{"id":"https://openalex.org/W2166970039","doi":"https://doi.org/10.1109/robot.2004.1307192","title":"Artificial potential biased probabilistic roadmap method","display_name":"Artificial potential biased probabilistic roadmap method","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2166970039","doi":"https://doi.org/10.1109/robot.2004.1307192","mag":"2166970039"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2004.1307192","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1307192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056610724","display_name":"Daniel Aarno","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"D. Aarno","raw_affiliation_strings":["Centre for Autonomous Systems, Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Autonomous Systems, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023792180","display_name":"Danica Kragi\u0107","orcid":"https://orcid.org/0000-0003-2965-2953"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"D. Kragic","raw_affiliation_strings":["Centre for Autonomous Systems, Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Autonomous Systems, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066237365","display_name":"Henrik I. Christensen","orcid":"https://orcid.org/0000-0002-7465-7502"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"H.I. Christensen","raw_affiliation_strings":["Centre for Autonomous Systems, Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Autonomous Systems, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":36,"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":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7883649468421936},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.7784220576286316},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7042314410209656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.658604085445404},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6386160850524902},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5926454067230225},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5705211162567139},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5089888572692871},{"id":"https://openalex.org/keywords/free-space","display_name":"Free space","score":0.4699787199497223},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.46802860498428345},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.456956148147583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.431369423866272},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42297452688217163},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.39682096242904663},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3400824964046478},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20388191938400269},{"id":"https://openalex.org/keywords/detector","display_name":"Detector","score":0.16907212138175964},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11716970801353455},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08600345253944397},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07404938340187073}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7883649468421936},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.7784220576286316},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7042314410209656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.658604085445404},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6386160850524902},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5926454067230225},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5705211162567139},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5089888572692871},{"id":"https://openalex.org/C2988672794","wikidata":"https://www.wikidata.org/wiki/Q11475","display_name":"Free space","level":2,"score":0.4699787199497223},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.46802860498428345},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.456956148147583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.431369423866272},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42297452688217163},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.39682096242904663},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3400824964046478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20388191938400269},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.16907212138175964},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11716970801353455},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08600345253944397},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07404938340187073},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"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":1,"locations":[{"id":"doi:10.1109/robot.2004.1307192","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1307192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W103015137","https://openalex.org/W953723390","https://openalex.org/W1554056522","https://openalex.org/W1586438301","https://openalex.org/W1588906117","https://openalex.org/W1670942551","https://openalex.org/W2051626883","https://openalex.org/W2055891854","https://openalex.org/W2083093559","https://openalex.org/W2109212155","https://openalex.org/W2110144538","https://openalex.org/W2128990851","https://openalex.org/W2134741043","https://openalex.org/W2142644931","https://openalex.org/W2160032073","https://openalex.org/W2622020362","https://openalex.org/W4206246621","https://openalex.org/W6604154422","https://openalex.org/W6633103536","https://openalex.org/W6635058101","https://openalex.org/W6637067985","https://openalex.org/W6679000354","https://openalex.org/W7028159486"],"related_works":["https://openalex.org/W2381469031","https://openalex.org/W2137520303","https://openalex.org/W2389713625","https://openalex.org/W2152311680","https://openalex.org/W4321065611","https://openalex.org/W2065499315","https://openalex.org/W2100656238","https://openalex.org/W2547276573","https://openalex.org/W163864709","https://openalex.org/W4308651025"],"abstract_inverted_index":{"Probabilistic":[0],"roadmap":[1],"methods":[2],"(PRM)":[3],"have":[4],"been":[5],"successfully":[6],"used":[7,57,80],"to":[8,41,58,81],"solve":[9],"difficult":[10],"path":[11],"planning":[12],"problems":[13],"but":[14],"their":[15],"efficiency":[16],"is":[17,56,79],"limited":[18],"when":[19],"the":[20,28,43,60,68,75,83],"free":[21,69],"space":[22],"contains":[23],"narrow":[24,49,65],"passages":[25],"through":[26,48],"which":[27],"robot":[29],"must":[30],"pass.":[31],"This":[32],"paper":[33],"presents":[34],"a":[35,52],"new":[36],"sampling":[37,54],"scheme":[38,55],"that":[39],"aims":[40],"increase":[42,59],"probability":[44],"of":[45,62,67,74,85],"finding":[46],"paths":[47],"passages.":[50],"Here,":[51],"biased":[53],"distribution":[61,84],"nodes":[63],"in":[64],"regions":[66],"space.":[70],"A":[71],"partial":[72],"computation":[73],"artificial":[76],"potential":[77],"field":[78],"bias":[82],"nodes.":[86]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}