kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Artificial potential biased probabilistic roadmap method
KTH, Superseded Departments (pre-2005), Numerical Analysis and Computer Science, NADA.
KTH, Superseded Departments (pre-2005), Numerical Analysis and Computer Science, NADA.ORCID iD: 0000-0003-2965-2953
KTH, Superseded Departments (pre-2005), Numerical Analysis and Computer Science, NADA.
2004 (English)In: 2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS, 2004, p. 461-466Conference paper, Published paper (Refereed)
Abstract [en]

Probabilistic roadmap methods (PRMs) have been successfully used to solve difficult path planning problems but their efficiency is limited when the free space contains narrow passages through which the robot must pass. This paper presents a new sampling scheme that aims to increase the probability of finding paths through narrow passages. Here, a biased sampling scheme is used to increase the distribution of nodes in narrow regions of the free space. A partial computation of the artificial potential field is used to bias the distribution of nodes.

Place, publisher, year, edition, pages
2004. p. 461-466
Series
IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ISSN 1050-4729
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-44357DOI: 10.1109/ROBOT.2004.1307192ISI: 000221794800073Scopus ID: 2-s2.0-3042621783ISBN: 0-7803-8232-3 (print)OAI: oai:DiVA.org:kth-44357DiVA, id: diva2:450899
Conference
IEEE International Conference on Robotics and Automation Location: New Orleans, LA Date: APR 26-MAY 01, 2004
Note
QC 20111024Available from: 2011-10-24 Created: 2011-10-20 Last updated: 2022-06-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Kragic, Danica

Search in DiVA

By author/editor
Aarno, DanielKragic, DanicaChristensen, Henrik
By organisation
Numerical Analysis and Computer Science, NADA
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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