title: Hierarchical incremental path planning and situation-dependent optimized dynamic motion planning considering accelerations.
abstract: This paper studies a hierarchical approach for incrementally driving a nonholonomic mobile robot to its destination in unknown environments. The A* algorithm is modified to handle a map containing unknown information. Based on it, optimal (discrete) paths are incrementally generated with a periodically updated map. Next, accelerations in varying velocities are taken into account in predicting the robot pose and the robot trajectory resulting from a motion command. Obstacle constraints are transformed to suitable velocity limits so that the robot can move as fast as possible while avoiding collisions when needed. Then, to trace the discrete path, the system searches for a waypoint-directed optimized motion in a reduced 1-D translation or rotation velocity space. Various situations of navigation are dealt with by using different strategies rather than a single objective function. Extensive simulations and experiments verified the efficacy of the proposed approach.
authors.affiliation: Electrical and Computer Engineering Department, National University of Singapore, Singapore 117576. laixuecheng@alumni.nus.edu.sg
authors.forename: Xue-Cheng
authors.initials: XC
authors.lastname: Lai
authors.forename: Shuzhi Sam
authors.initials: SS
authors.lastname: Ge
authors.forename: Abdullah
authors.initials: A
authors.lastname: Al Mamun
mesh_terms: D000054:Acceleration; D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D003661:Decision Support Techniques; D008962:Models, Theoretical; D009038:Motion; D010363:Pattern Recognition, Automated / Q000379:methods*