{"id":"https://openalex.org/W1554056522","doi":null,"title":"On probabilistic completeness and expected complexity for probabilistic path planning","display_name":"On probabilistic completeness and expected complexity for probabilistic path planning","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1554056522","mag":"1554056522"},"language":"en","primary_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/18328","doi":null,"is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/18328","pdf_url":"https://dspace.library.uu.nl/handle/1874/18328","source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},"volume":null,"type":"other","is_traditional":false,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/handle/1874/18328","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027514967","display_name":"Petr Svestka","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. \u0160vestka","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5027514967"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-path-planning","display_name":"probabilistic path planning","score":0.9449999928474426},{"id":"https://openalex.org/keywords/probabilistic-completeness","display_name":"probabilistic completeness","score":0.9909999966621399},{"id":"https://openalex.org/keywords/expected-runtime","display_name":"expected running time","score":0.875},{"id":"https://openalex.org/keywords/free-configuration-space","display_name":"free configuration space","score":0.796999990940094},{"id":"https://openalex.org/keywords/robot-path-planning","display_name":"robot path planning","score":0.7490000128746033},{"id":"https://openalex.org/keywords/nonholonomic-mobile-robots","display_name":"nonholonomic mobile robots","score":0.8169999718666077},{"id":"https://openalex.org/keywords/articulated-robots","display_name":"articulated robots","score":0.8529999852180481},{"id":"https://openalex.org/keywords/multi-robot-planning","display_name":"multi-robot planning","score":0.8560000061988831},{"id":"https://openalex.org/keywords/logarithmic-time-complexity","display_name":"logarithmic time complexity","score":0.6110000014305115}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7747915983200073},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6741359233856201},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6684868335723877},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6126962900161743},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5914946794509888},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5785179138183594},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5516687631607056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4708516001701355},{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.4681316614151001},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.46610650420188904},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.41342419385910034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37005066871643066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3626001477241516},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.30923205614089966},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22299546003341675},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/18328","doi":null,"is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/18328","pdf_url":"https://dspace.library.uu.nl/handle/1874/18328","source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.3881","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.3881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1996/1996-20.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.3624","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.3624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-20.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.library.uu.nl:1874/18328","doi":null,"is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/18328","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Report"},{"id":"mag:1554056522","doi":null,"is_oa":false,"landing_page_url":"http://dspace.library.uu.nl/bitstream/1874/18328/2/svestka_96_on_probabilistic.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306482134","display_name":"Utrecht University: Information and Computing Sciences eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Utrecht University: Information and Computing Sciences eBooks","raw_type":null}],"best_oa_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/18328","doi":null,"is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/18328","pdf_url":"https://dspace.library.uu.nl/handle/1874/18328","source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1554056522.pdf","grobid_xml":"https://content.openalex.org/works/W1554056522.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W1537285207","https://openalex.org/W1548297388","https://openalex.org/W1586438301","https://openalex.org/W1779261316","https://openalex.org/W1903576784","https://openalex.org/W1985578018","https://openalex.org/W2013452693","https://openalex.org/W2022921915","https://openalex.org/W2051626883","https://openalex.org/W2096636360","https://openalex.org/W2101419433","https://openalex.org/W2101745607","https://openalex.org/W2110982396","https://openalex.org/W2128990851","https://openalex.org/W2131429071","https://openalex.org/W2134741043","https://openalex.org/W2146467128","https://openalex.org/W2158380902","https://openalex.org/W3188953039"],"related_works":["https://openalex.org/W4206246621","https://openalex.org/W1716359979","https://openalex.org/W7097184213","https://openalex.org/W7100049404","https://openalex.org/W2889786920","https://openalex.org/W2166379537","https://openalex.org/W2949150198","https://openalex.org/W2058240764","https://openalex.org/W2293271910","https://openalex.org/W4394670938"],"abstract_inverted_index":{"The":[0],"probabilistic":[1,53],"path":[2,14],"planner":[3],"(PPP)":[4],"is":[5],"a":[6,17],"general":[7,49],"planning":[8],"scheme":[9],"that":[10,51,96,112],"yields":[11],"fast":[12],"robot":[13,65],"planners":[15],"for":[16],"wide":[18],"variety":[19],"of":[20,26,45,55,83,101,109],"problems,":[21],"involving,":[22],"e.g.,":[23],"high":[24],"degree":[25],"freedom":[27],"articulated":[28],"robots,":[29,31],"nonholonomic":[30],"and":[32,57],"multiple":[33],"robots.":[34],"In":[35],"this":[36],"paper":[37],"we":[38,58,68,94],"gointo":[39],"theoretical":[40],"aspects":[41],"regarding":[42],"the":[43,76,84,97,107,110],"behaviour":[44],"PPP.":[46],"We":[47],"formulate":[48],"properties":[50],"guarantee":[52],"completeness":[54],"PPP,":[56],"show":[59,95],"how":[60],"these":[61],"apply":[62],"to":[63],"various":[64],"types.":[66],"Furthermore,":[67],"present":[69],"results":[70],"which,":[71],"under":[72,90],"certain":[73],"assumptions":[74],"on":[75],"free":[77],"con":[78],"guration":[79],"space,":[80],"give":[81],"estimates":[82],"expected":[85,98],"running":[86,99],"times.":[87],"For":[88],"example,":[89],"one":[91],"such":[92],"assumption,":[93],"time":[100],"PPP":[102],"grows":[103],"only":[104],"logarithmically":[105],"with":[106],"complexity":[108],"problem":[111],"it":[113],"solves.":[114],"1":[115]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}