Dynamic Algorithm Selection for Mobile Robots Motion Planning

Selecting the appropriate algorithms to construct a synthetic planner for mobile robots in a given environment is a very beneficial task. The planner of mobile robots is a highlyconfigurable system, which mainly includes obstacle avoidance and navigation algorithms. This paper presents a framework t...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2019 6th International Conference on Dependable Systems and Their Applications (DSA) s. 499 - 500
Hlavní autoři:	Tang, Wenbing, Zheng, Libin, Jiang, Mingyue, Ding, Zuohua
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.01.2020
Témata:	dynamic algorithm selection Dynamics Heuristic algorithms mobile robot Mobile robots motion planning Navigation Planning Runtime Task analysis
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Selecting the appropriate algorithms to construct a synthetic planner for mobile robots in a given environment is a very beneficial task. The planner of mobile robots is a highlyconfigurable system, which mainly includes obstacle avoidance and navigation algorithms. This paper presents a framework to dynamically combine the synthetic planner according to the robot surrounding environment and the robotic states. Furthermore, two feasible approaches are introduced to select, i.e., the blackbox approach and the rule-based approach.
DOI:	10.1109/DSA.2019.00084