IECON 2021 – 47th Annual Conference of the IEEE Industrial Electronics Society 2021
DOI: 10.1109/iecon48115.2021.9589658
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Obstacles Avoidance Using Nonlinear Model Predictive Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 33 publications
0
3
0
Order By: Relevance
“…The problem setup is for the vehicles to move from the initial state to the final state without colliding with each other, while simultaneously avoiding other stationary and moving obstacles. A method to avoid obstacles by giving constraints to the MPC has also been proposed (12)(14) . However, these methods incorporate the prohibited area into the constraint, and if the plant moves into the prohibited area, it may become unstable.…”
Section: Figmentioning
confidence: 99%
See 1 more Smart Citation
“…The problem setup is for the vehicles to move from the initial state to the final state without colliding with each other, while simultaneously avoiding other stationary and moving obstacles. A method to avoid obstacles by giving constraints to the MPC has also been proposed (12)(14) . However, these methods incorporate the prohibited area into the constraint, and if the plant moves into the prohibited area, it may become unstable.…”
Section: Figmentioning
confidence: 99%
“…Each weight matrices of the cost function were given as follows: (10,10), Q ob3 = 200, P ob1 = 50Q ob1 , P ob3 = 50Q ob3 . In addition, d desired = 0.7 m, d rep = 1.0 m. In the conventional method based on the reference (12) , ( 16) was modified as (27).…”
Section: Simulation Setupmentioning
confidence: 99%
“…Different from the work of [16], our MPC algorithm does not require additional computation for predicting the obstacle's speed, which could lead to higher computational time and wrong prediction in the case of "tricky" obstacles. This method, initially developed in our previous [17], incorporates obstacle avoidance as a constraint while solving the optimal control problem. The performance of the discretization methods as well as the effect of prediction horizon on the computational time is also studied.…”
Section: Introductionmentioning
confidence: 99%