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

Authors:
Ronggang Yue;Jizhong Xiao;Shaoping Wang;Samleo L. Joseph
Affiliations:
Electrical Engineering Department, The City College, City University of New York, New York, NY;Electrical Engineering Department, CUNY, City College, NY;Department of Mechanical and Electronic Engineering, School of Automation Science and Electrical Engineering, Beihang University, Beijing, China;Electrical Engineering Department, CUNY, City College, NY
Venue:
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Year:
2009

Citing 5
Cited 0

Discrete-time control systems (2nd ed.)

Discrete-time control systems (2nd ed.)
Introduction to Linear Optimization

Introduction to Linear Optimization
Path planning on a cuboid using genetic algorithms

Information Sciences: an International Journal
Iterative MILP methods for vehicle-control problems

IEEE Transactions on Robotics
Conflict resolution problems for air traffic management systems solved with mixed integer programming

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.00

Visualization

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.