Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract).
Faten AljalaudNathan R. SturtevantPublished in: SOCS (2013)
Keyphrases
- extended abstract
- path planning
- tree search
- path finding
- multi agent
- mobile robot
- obstacle avoidance
- path planning algorithm
- collision avoidance
- branch and bound
- dynamic environments
- search tree
- motion planning
- multi robot
- optimal path
- search algorithm
- potential field
- constraint propagation
- multiple robots
- multi agent systems
- aerial vehicles
- minimum cost path
- mathematical programming
- minimum cost
- optimal solution
- reinforcement learning
- benchmark problems
- state space
- robot path planning