Modeling and path planning of the city-climber robot part II: 3D path planning using mixed integer linear programming

  • Ronggang Yue*
  • , Jizhong Xiao
  • , Samleo L. Joseph
  • , Shaoping Wang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This is the second part of a series papers on modeling and path planning of the City-Climber robot. This paper presents a path planning method for the City-Climber robot using mixed integer linear programming (MILP) in 3D building environments that consist of objects with primitive geometrical shapes. In order to use MILP to solve obstacle avoidance problems, we first simplify and decouple the robot dynamic model by introducing a restricting admissible control. The decoupled model and obstacle can be rewritten as a linear program with mixed integer linear constraints that account for the collision avoidance. A key benefit of this approach is that the path optimization can be readily solved using the AMPL and CPLEX optimization software with a Matlab interface. Simulation results show that the framework of MILP is well suited for path planning and obstacle avoidance problems for the wall-climbing robot in 3D environments.

Original languageEnglish
Title of host publication2009 IEEE International Conference on Robotics and Biomimetics, ROBIO 2009
Pages2391-2396
Number of pages6
DOIs
StatePublished - 2009
Event2009 IEEE International Conference on Robotics and Biomimetics, ROBIO 2009 - Guilin, China
Duration: 19 Dec 200923 Dec 2009

Publication series

Name2009 IEEE International Conference on Robotics and Biomimetics, ROBIO 2009

Conference

Conference2009 IEEE International Conference on Robotics and Biomimetics, ROBIO 2009
Country/TerritoryChina
CityGuilin
Period19/12/0923/12/09

Fingerprint

Dive into the research topics of 'Modeling and path planning of the city-climber robot part II: 3D path planning using mixed integer linear programming'. Together they form a unique fingerprint.

Cite this