Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Multi-Robot Path Following with Visual Connectivity
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
TU Delft.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
2011 (English)In: Conference Record: Asilomar Conference on Signals, Systems and Computers, IEEE , 2011, 1466-1471 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider a group of N robots moving through an obstacle field, where only robots that have a clear line of sight can communicate. When passing the obstacles, the group must coordinate its motion to remain connected. We propose using the path–velocity decomposition: Given obstacle-free paths that fulfill a higher-level goal, we propose a method to coordinate the robot motions along the paths so visual connectivity is maintained. The problem is shown to be equivalent to finding a path through an N-dimensional configuration space, avoiding unconnected configurations. We solve this problem with a rapidly exploring random tree algorithm and demonstrate by simulations how the solution time varies with the obstacle density.

Place, publisher, year, edition, pages
IEEE , 2011. 1466-1471 p.
Series
Conference Record - Asilomar Conference on Signals, Systems and Computers, ISSN 1058-6393 ; 6190261
National Category
Robotics
Identifiers
URN: urn:nbn:se:kth:diva-58784DOI: 10.1109/ACSSC.2011.6190261Scopus ID: 2-s2.0-84861312721ISBN: 978-146730323-1 (print)OAI: oai:DiVA.org:kth-58784DiVA: diva2:474049
Conference
5th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011; Pacific Grove, CA, United States, 6-9 November, 2011
Note

QC 20120131

Available from: 2012-01-31 Created: 2012-01-09 Last updated: 2014-10-03Bibliographically approved

Open Access in DiVA

lindhe2011mrp(554 kB)251 downloads
File information
File name FULLTEXT01.pdfFile size 554 kBChecksum SHA-512
88683a509ba9794dbb0a57c640f6b13847c29b2f6fdfca954dbd562d49d87dfdd30c1a5b3ea15171aa853196d0c6b022eaa87b277f97b7dc6a03db335e8358a4
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Johansson, Karl Henrik

Search in DiVA

By author/editor
Lindhé, MagnusJohansson, Karl Henrik
By organisation
Automatic ControlACCESS Linnaeus Centre
Robotics

Search outside of DiVA

GoogleGoogle Scholar
Total: 251 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 51 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf