(forward) Graph Search

Theta* and A* path planning. The Theta* algorithm is implemented based on :

Nash, Alex, et al. "Theta^*: any-angle path planning on grids." AAAI. Vol. 7. 2007.

Theta* demo :

you can choose to use Theta* or A* and specifying cell size by passing argument to cmd :

p.s. : as you can see Theta* produce more realistic path than A*

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
README.md		README.md
astarsearch.cpp		astarsearch.cpp
astarsearch.h		astarsearch.h
breadthfirstsearch.cpp		breadthfirstsearch.cpp
breadthfirstsearch.h		breadthfirstsearch.h
fielditem.cpp		fielditem.cpp
fielditem.h		fielditem.h
forward-search-gui.pro		forward-search-gui.pro
forwardsearch.cpp		forwardsearch.cpp
forwardsearch.h		forwardsearch.h
graphitem.cpp		graphitem.cpp
graphitem.h		graphitem.h
graphsearch.cpp		graphsearch.cpp
graphsearch.h		graphsearch.h
main.cpp		main.cpp
mainwindow.cpp		mainwindow.cpp
mainwindow.h		mainwindow.h
moc_mainwindow.cpp		moc_mainwindow.cpp
robotmap.cpp		robotmap.cpp
robotmap.h		robotmap.h
thetastarsearch.cpp		thetastarsearch.cpp
thetastarsearch.h		thetastarsearch.h
ui_mainwindow.h		ui_mainwindow.h