Robust Mpc For Nonholonomic Robots With Moving Obstacle Avoidance
2020 IEEE 16TH INTERNATIONAL CONFERENCE ON CONTROL & AUTOMATION (ICCA)(2020)
Abstract
In this paper, we propose a robust model predictive control algorithm for discrete-time nonholonomic robot systems with additive disturbances. To achieve moving obstacle avoidance, the related polyhedral over-approximations are utilized to realize the reformulation of obstacle avoidance constraint. Thus, the resulting model predictive control optimization problem can be solved effectively by standard nonlinear programming solvers. Moreover, the theoretical guarantees for recursive feasibility and input-to-state stability are provided. Finally, the efficiency of the proposed algorithm is verified by the simulation results.
MoreTranslated text
Key words
robust MPC,nonholonomic robots,robust model predictive control algorithm,discrete-time nonholonomic robot systems,additive disturbances,related polyhedral over-approximations,obstacle avoidance constraint,resulting model predictive control optimization problem,standard nonlinear programming solvers
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined