Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Distributed Deconfliction Algorithm for Unmanned Aerial Vehicles with Limited Range and Field of View Sensors
 
conference paper

Distributed Deconfliction Algorithm for Unmanned Aerial Vehicles with Limited Range and Field of View Sensors

Roelofsen, Steven Adriaan  
•
Martinoli, Alcherio  
•
Gillet, Denis  
2015
2015 American Control Conference (ACC)
American Control Conference

This paper proposes a novel approach for collision avoidance between Unmanned Aerial Vehicles (UAVs) with limited range and field of view sensors. The algorithm is designed for unicycle vehicles that need to fly above a specific minimal speed to maintain flight. It uses a navigation function approach when the UAV is clear from conflict and smoothly switches to a collision avoidance maneuver when other UAVs are encountered. We show that the proposed avoidance algorithm can ensure a collision-free path. We also carry out a throughout quantitative analysis of the algorithm singularities and propose heuristic recipes for avoiding deadlock situations. Simulations are performed to show the effectiveness of the algorithm.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

paper_submitted_acc_2015_camera_ready.pdf

Type

Preprint

cris-layout.advanced-attachment.oaire.version

http://purl.org/coar/version/c_71e4c1898caa6e32

Access type

openaccess

Size

505.71 KB

Format

Adobe PDF

Checksum (MD5)

a44751087baedf9845c08588cf301ea2

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés