2-Dimensional minimum cost path planning using a cellular automaton architecture.
Panagiotis TzionasPhilippos TsalidesAntonios ThanailakisPublished in: Integr. (1993)
Keyphrases
- path planning
- minimum cost
- cellular automaton
- cellular automata
- minimum cost path
- np hard
- path planning algorithm
- network flow
- mobile robot
- configuration space
- path planner
- collision avoidance
- approximation algorithms
- dynamic environments
- multi robot
- network flow problem
- spanning tree
- obstacle avoidance
- capacity constraints
- motion planning
- dynamic and uncertain environments
- degrees of freedom
- autonomous navigation
- autonomous systems
- finite state machines
- unmanned aerial vehicles
- optimal path
- potential field
- robot path planning
- collision free
- dynamic programming
- special case
- search algorithm
- optimal solution