Probabilistic multi robot path planning in dynamic environments: a comparison between A* and DFS

Keyphrases

• Dynamic Environment 100%
• Depth First Search Algorithm 100%
• A* Search Algorithm 100%
• Robot Path Planning 100%
• Free Space 50%
• Near-optimal 50%
• Ending Point 50%
• Path Planning Problem 50%
• Whole Process 50%
• Workspace 50%
• Preprocessing Techniques 50%
• Static Obstacles 50%
• Moving Obstacles 50%
• Global Planner 50%
• Probabilistic Roadmap 50%
• Avoid Collision 50%
• Configuration Space 50%
• Probabilistic Roadmap Planners 50%

Computer Science

• Dynamic Environment 100%
• robot path planning 100%
• multiple robot 100%
• Searching Algorithm 100%
• Robot 33%
• Starting Point 33%
• path planning problem 33%
• Preprocessing Phase 33%
• Configuration Space 33%

Engineering

• Path Planning 100%
• Search Algorithm 100%
• Optimal Path 66%
• Free Space 33%
• Simulation Result 33%
• Robot 33%
• Starting Point 33%
• Configuration Space 33%
• Preprocessing Phase 33%