This project will develop a configurable, extensible framework for path planning. The path planning problem is to find an optimal route from multiple 3D start points to multiple 3D end points through freespace, subjected to a configurable and extensible set of constraints, such as no-fly zones, air corridors, turning radius, etc. The route is to be described with as few way points as possible. Different search and incremental search algorithms can also be selected by the framework.
Possible frameworks:
Uploading ....