In this paper we address the obstacle avoidance motion planning problem for leader-follower vehicles configurations operating in static environments. By resorting to set-theoretic ideas, a receding horizon control algorithm is proposed for robots modelled by linear time-invariant (LTI) systems subject to input and state constraints. Terminal robust positively invariant regions and sequences of precomputed inner approximations of the one-step controllable sets are on-line exploited to compute the commands to be applied in a receding horizon fashion. Moreover, we prove that the design of both terminal sets and one-step ahead controllable regions is achieved in a distributed sense. An illustrative example is used to show the effectiveness of the proposed control strategy.

A Distributed Obstacle Avoidance MPC Strategy for Leader-Follower Formations

SCORDAMAGLIA, Valerio
2014-01-01

Abstract

In this paper we address the obstacle avoidance motion planning problem for leader-follower vehicles configurations operating in static environments. By resorting to set-theoretic ideas, a receding horizon control algorithm is proposed for robots modelled by linear time-invariant (LTI) systems subject to input and state constraints. Terminal robust positively invariant regions and sequences of precomputed inner approximations of the one-step controllable sets are on-line exploited to compute the commands to be applied in a receding horizon fashion. Moreover, we prove that the design of both terminal sets and one-step ahead controllable regions is achieved in a distributed sense. An illustrative example is used to show the effectiveness of the proposed control strategy.
Distributed robust controller synthesis; Convex optimization; Constrained control
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12318/17912
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact