Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this paper we present a navigation method for mobile robots in partially known indoor environments based on integration of graph based search algorithms and dynamic window local obstacle avoidance method. With the attention on a dynamic environment three different graph based search algorithms for global geometrical path planning are considered and compared: A*, D* and focussed D* algorithm. The admissible robot trajectories are generated in the dynamic window local obstacle avoider module that ensures safe robot operation. A simple and efficient procedure to the selection of appropriate motion commands based upon alignment of acquired trajectories and global geometric path is proposed. The initial a priori knowledge is used about environment in the form of the occupancy grid map that is incrementally updated in runtime. The algorithms were verified both in simulation and experimentally on a Pioneer 2DX mobile robot using laser range sensor where a good correlation was proven.
Maryam Kamgarpour, Stefana Parascho, Ziqi Wang, Jingwen Wang, Gabriel Rémi Vallat
Alcherio Martinoli, Wanting Jin