An Empirical Comparison of Any-Angle Path-Planning Algorithms

We compare five any-angle path-planning algorithms, Theta*, Block A*, Field D*, ANYA, and Any-Angle Subgoal Graphs in terms of solution quality and runtime. Any-angle path-planning is a fairly new research area, and no direct comparison exists between these algorithms. We implement each algorithm fr...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the International Symposium on Combinatorial Search Vol. 6; no. 1; pp. 206 - 210
Main Authors Uras, Tansel, Koenig, Sven
Format Journal Article
LanguageEnglish
Published 01.09.2021
Online AccessGet full text
ISSN2832-9171
2832-9163
2832-9163
DOI10.1609/socs.v6i1.18382

Cover

Abstract We compare five any-angle path-planning algorithms, Theta*, Block A*, Field D*, ANYA, and Any-Angle Subgoal Graphs in terms of solution quality and runtime. Any-angle path-planning is a fairly new research area, and no direct comparison exists between these algorithms. We implement each algorithm from scratch and use similar implementations to provide a fair comparison.
AbstractList We compare five any-angle path-planning algorithms, Theta*, Block A*, Field D*, ANYA, and Any-Angle Subgoal Graphs in terms of solution quality and runtime. Any-angle path-planning is a fairly new research area, and no direct comparison exists between these algorithms. We implement each algorithm from scratch and use similar implementations to provide a fair comparison.
Author Koenig, Sven
Uras, Tansel
Author_xml – sequence: 1
  givenname: Tansel
  surname: Uras
  fullname: Uras, Tansel
– sequence: 2
  givenname: Sven
  surname: Koenig
  fullname: Koenig, Sven
BookMark eNqFkDtPwzAUhS1UJErpzJo_kNaPxI4HhqgqD6kSHWC2blynteTYkR1A-fe0FDEwwHTP8p1z9V2jiQ_eIHRL8IJwLJcp6LR455YsSMUqeoGmtGI0l4SzyU8W5ArNU7INLrFgAmMxRXe1z9Zdb6PV4LJV6HqINgWfhTar_ZjXfu9MtoXhkG8deG_9PqvdPkQ7HLp0gy5bcMnMv-8Mvd6vX1aP-eb54WlVb3JNpKA5l1yUVPKmOf7DyI6KxlQgNWguZdFWhhuBGS8pKaBsd7zQnGoqNFS8kEwCmyF87n3zPYwf4Jzqo-0gjopgdTKgTgbUyYD6MnBEyjOiY0gpmlZpO8Bggx8iWPcHt_zF_bf0CX_Acuo
CitedBy_id crossref_primary_10_1109_LRA_2024_3460409
crossref_primary_10_1109_TG_2020_3012602
ContentType Journal Article
DBID AAYXX
CITATION
ADTOC
UNPAY
DOI 10.1609/socs.v6i1.18382
DatabaseName CrossRef
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
EISSN 2832-9163
EndPage 210
ExternalDocumentID 10.1609/socs.v6i1.18382
10_1609_socs_v6i1_18382
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
M~E
ADTOC
UNPAY
ID FETCH-LOGICAL-c1972-69675296bb16331d27be8a9cac6994f8e6e70365214a5fd64c62c27ca864939a3
IEDL.DBID UNPAY
ISSN 2832-9171
2832-9163
IngestDate Wed Oct 01 16:00:49 EDT 2025
Thu Apr 24 23:05:29 EDT 2025
Tue Jul 01 04:10:43 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1972-69675296bb16331d27be8a9cac6994f8e6e70365214a5fd64c62c27ca864939a3
OpenAccessLink https://proxy.k.utb.cz/login?url=https://ojs.aaai.org/index.php/SOCS/article/download/18382/18173
PageCount 5
ParticipantIDs unpaywall_primary_10_1609_socs_v6i1_18382
crossref_citationtrail_10_1609_socs_v6i1_18382
crossref_primary_10_1609_socs_v6i1_18382
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2021-09-01
PublicationDateYYYYMMDD 2021-09-01
PublicationDate_xml – month: 09
  year: 2021
  text: 2021-09-01
  day: 01
PublicationDecade 2020
PublicationTitle Proceedings of the International Symposium on Combinatorial Search
PublicationYear 2021
SSID ssib050737007
Score 2.0578718
Snippet We compare five any-angle path-planning algorithms, Theta*, Block A*, Field D*, ANYA, and Any-Angle Subgoal Graphs in terms of solution quality and runtime....
SourceID unpaywall
crossref
SourceType Open Access Repository
Enrichment Source
Index Database
StartPage 206
Title An Empirical Comparison of Any-Angle Path-Planning Algorithms
URI https://ojs.aaai.org/index.php/SOCS/article/download/18382/18173
UnpaywallVersion publishedVersion
Volume 6
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2832-9163
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssib050737007
  issn: 2832-9163
  databaseCode: M~E
  dateStart: 0
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT4NAEN7Y9qAXH1FjfTQcPOiB97KwBw-kadOYtDapTeqJLAvUKoWmpZp68Lc7C7RRE2OMF8JhIOzMwDcTZr8PoUuowB0KQARtCdFkrHMqO8SMZGZElOuGFtB8f0W3RzpDfDuyRp928adPC4UxVvzEzwkDBUuEOrhrDtTSl2ogaORTFqiQjo4BR902K6hGLKjGq6g27PXdB6EpB8kK73Iuplae23rJ7kM0qsLqF8oLmehKfp8vwLS9TGZs9cri-BPatPcQWz9nMWTyrCwzX-Fv3ygc_7OQfbRblqKSW5gdoK0wOUQ3biK1prNJzhwiNTcqhVIaSW6ykt1kHIdSH-pGea13JLnxOJ1Pssfp4ggN2637ZkcuJRZkLvTGZEKhYTAo8X3wk6kHhu2HDqOccUIpjpyQhIKhCzAeMysKCObE4IbNmUMwNSkzj1E1SZPwBEnYtxwbui8t5Ax6vsgJAhtTgYY-ho-GWUfK2r8eL_nHhQxG7Ik-BALiiYB4IiBe7o86utpcMCuoN342vd4E7Dfb0z_YnqEdQ8yw5DNl56iazZfhBRQhmd9Ale57q1Fm2wd4S9np
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEF60PejFByrWFzl40EPem0324CGUliKohVqop7DZbGo1TUqbKvXXO5ukpQoi4iXkMAnZmUm-GTL7fQhdQgXuUQAiaEuIoWKTU9UjdqwyK6bctIyIFvsr7u5Jp49vB85gbRd_9jLTGGPlT_yCMFCyROi9h2ZPr3ypR5JGPmORDunoWXA0XXsT1YkD1XgN1fv3Xf9JaspBssK7XIipVeeuWbH7EIPqsPqZ9kZGplbc5wswbc3TCVu8syRZQ5v2LmLL5yyHTF61eR5q_OMbheN_FrKHdqpSVPFLs320IdIDdOOnSms8GRXMIUpzpVKoZLHipwvVT4eJULpQN6pLvSPFT4bZdJQ_j2eHqN9uPTY7aiWxoHKpN6YSCg2DRUkYgp9sM7LcUHiMcsYJpTj2BBGSoQswHjMnjgjmxOKWy5lHMLUps49QLc1ScYwUHDqeC92XITiDni_2osjFVKJhiOGjYTeQtvRvwCv-cSmDkQSyD4GABDIggQxIUPijga5WF0xK6o2fTa9XAfvN9uQPtqdo25IzLMVM2Rmq5dO5OIciJA8vqjz7BGFg2Lg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Empirical+Comparison+of+Any-Angle+Path-Planning+Algorithms&rft.jtitle=Proceedings+of+the+International+Symposium+on+Combinatorial+Search&rft.au=Uras%2C+Tansel&rft.au=Koenig%2C+Sven&rft.date=2021-09-01&rft.issn=2832-9171&rft.eissn=2832-9163&rft.volume=6&rft.issue=1&rft.spage=206&rft.epage=210&rft_id=info:doi/10.1609%2Fsocs.v6i1.18382&rft.externalDBID=n%2Fa&rft.externalDocID=10_1609_socs_v6i1_18382
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2832-9171&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2832-9171&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2832-9171&client=summon