Decentralized platooning with obstacle avoidance for car-like vehicles with limited sensing

Ioannis M. Delimpaltadakis, Charalampos P. Bechlioulis, Kostas J. Kyriakopoulos

Research output: Contribution to journalArticlepeer-review

Abstract

In this letter, we consider the predecessor-following control problem for a platoon of car-like vehicles moving on a planar surface with cyclic obstacles. Each vehicle is equipped with an on-board camera that detects its preceding vehicle, and a laser scanner that detects the obstacles around it. Within this framework, we design a fully decentralized control scheme, in the sense that each vehicle calculates its own control signal incorporating only local information, acquired by its on-board camera and laser scanner. Collisions with obstacles, collisions between successive vehicles and connectivity breaks owing to the limited field of view of the camera as well as to visual occlusions raised by static obstacles are provably avoided. Moreover, the transient and steady-state response of the closed-loop system is a priori determined by certain designer-specified functions and is fully decoupled by the number of vehicles in the platoon and the control gains selection. Finally, a simulation study is carried out inMATLAB and Coppelia Robotics V-REP to prove the control protocol's efficiency.

Original languageEnglish (US)
Pages (from-to)835-840
Number of pages6
JournalIEEE Robotics and Automation Letters
Volume3
Issue number2
DOIs
StatePublished - Apr 2018

Keywords

  • Car-like vehicle
  • Motion planning
  • Platoon

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Biomedical Engineering
  • Human-Computer Interaction
  • Mechanical Engineering
  • Computer Vision and Pattern Recognition
  • Computer Science Applications
  • Control and Optimization
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Decentralized platooning with obstacle avoidance for car-like vehicles with limited sensing'. Together they form a unique fingerprint.

Cite this