{"id":"https://openalex.org/W2145760102","doi":"https://doi.org/10.1109/robot.2002.1013371","title":"Parallel path planning with multiple evasion strategies","display_name":"Parallel path planning with multiple evasion strategies","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2145760102","doi":"https://doi.org/10.1109/robot.2002.1013371","mag":"2145760102"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2002.1013371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2002.1013371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)","raw_type":"proceedings-article"},"type":"article","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/A5067471531","display_name":"Stefano Caselli","orcid":"https://orcid.org/0000-0003-0774-7871"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"S. Caselli","raw_affiliation_strings":["Dipartimento di Ingegneria dellE28099Informazione, Universit\u00e0 di Parma, Parma, Italy","Dipt. di Ingegneria dell'Informazione, Parma Univ., Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dellE28099Informazione, Universit\u00e0 di Parma, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]},{"raw_affiliation_string":"Dipt. di Ingegneria dell'Informazione, Parma Univ., Italy","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078819555","display_name":"Monica Reggiani","orcid":"https://orcid.org/0000-0002-5029-1892"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Reggiani","raw_affiliation_strings":["Dipartimento di Ingegneria dellE28099Informazione, Universit\u00e0 di Parma, Parma, Italy","Dipt. di Ingegneria dell'Informazione, Parma Univ., Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dellE28099Informazione, Universit\u00e0 di Parma, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]},{"raw_affiliation_string":"Dipt. di Ingegneria dell'Informazione, Parma Univ., Italy","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036772394","display_name":"R. Sbravati","orcid":null},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"R. Sbravati","raw_affiliation_strings":["Dipartimento di Ingegneria dellE28099Informazione, Universit\u00e0 di Parma, Parma, Italy","Dipt. di Ingegneria dell'Informazione, Parma Univ., Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dellE28099Informazione, Universit\u00e0 di Parma, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]},{"raw_affiliation_string":"Dipt. di Ingegneria dell'Informazione, Parma Univ., Italy","institution_ids":["https://openalex.org/I124601658"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067471531"],"corresponding_institution_ids":["https://openalex.org/I124601658"],"apc_list":null,"apc_paid":null,"fwci":1.3459,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.82785591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"260","last_page":"266"},"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.9909999966621399,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.972100019454956,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/maxima-and-minima","display_name":"Maxima and minima","score":0.8698475360870361},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7627805471420288},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6704047322273254},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.6631919145584106},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.641253650188446},{"id":"https://openalex.org/keywords/potential-field","display_name":"Potential field","score":0.6405547857284546},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6239792108535767},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6111093163490295},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5721102952957153},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5557100176811218},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5286633968353271},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47249022126197815},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4586176872253418},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.42364105582237244},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27979832887649536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2432405650615692},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.207004576921463},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1566234529018402}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.8698475360870361},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7627805471420288},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6704047322273254},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6631919145584106},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.641253650188446},{"id":"https://openalex.org/C2986897749","wikidata":"https://www.wikidata.org/wiki/Q231761","display_name":"Potential field","level":2,"score":0.6405547857284546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6239792108535767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6111093163490295},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5721102952957153},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5557100176811218},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5286633968353271},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47249022126197815},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4586176872253418},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.42364105582237244},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27979832887649536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2432405650615692},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.207004576921463},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1566234529018402},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.0},{"id":"https://openalex.org/C8058405","wikidata":"https://www.wikidata.org/wiki/Q46255","display_name":"Geophysics","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/robot.2002.1013371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2002.1013371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.7987","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.7987","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rimlab.ce.unipr.it/Publications/ICRA2002.pdf","raw_type":"text"},{"id":"pmh:oai:www.research.unipd.it:11577/188643","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/188643","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7599999904632568,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322875","display_name":"Universit\u00e0 degli Studi di Parma","ror":"https://ror.org/02k7wn190"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W63574109","https://openalex.org/W1482129961","https://openalex.org/W1551413036","https://openalex.org/W1586438301","https://openalex.org/W1670942551","https://openalex.org/W1774803432","https://openalex.org/W1862454862","https://openalex.org/W1965244358","https://openalex.org/W1978301848","https://openalex.org/W2037907469","https://openalex.org/W2051626883","https://openalex.org/W2053407718","https://openalex.org/W2055699853","https://openalex.org/W2105588001","https://openalex.org/W2115726530","https://openalex.org/W2127556680","https://openalex.org/W2128990851","https://openalex.org/W2140581373","https://openalex.org/W2145882751","https://openalex.org/W2146467128","https://openalex.org/W2151402824","https://openalex.org/W2151931936","https://openalex.org/W2152202684","https://openalex.org/W2163171217","https://openalex.org/W2171266831","https://openalex.org/W2614380533","https://openalex.org/W3104753760","https://openalex.org/W6635058101","https://openalex.org/W6637067985","https://openalex.org/W6638073968","https://openalex.org/W6680635171"],"related_works":["https://openalex.org/W2067429764","https://openalex.org/W4388726836","https://openalex.org/W1965569281","https://openalex.org/W2062919732","https://openalex.org/W2573269332","https://openalex.org/W2546046681","https://openalex.org/W2893406334","https://openalex.org/W4324119413","https://openalex.org/W2153809277","https://openalex.org/W2015961810"],"abstract_inverted_index":{"Probabilistic":[0],"path":[1,130],"planning":[2,88,131],"driven":[3],"by":[4,52],"a":[5,9,24,63,101],"potential":[6,47,64,106,123],"field":[7,65,107,124],"is":[8,114],"well":[10],"established":[11],"technique":[12],"and":[13,109],"has":[14],"been":[15],"successfully":[16],"exploited":[17],"to":[18,77,127],"solve":[19,128],"complex":[20],"problems":[21],"arising":[22],"in":[23,36,45,87,94],"variety":[25],"of":[26,41,104,122],"domains.":[27],"However,":[28],"planners":[29],"implementing":[30],"this":[31,59],"approach":[32],"are":[33],"rather":[34],"inefficient":[35],"dealing":[37],"with":[38,74,91],"certain":[39],"types":[40],"local":[42,72],"minima":[43,73],"occurring":[44],"the":[46,105,120],"field,":[48],"especially":[49],"those":[50],"characterized":[51],"deep":[53],"or":[54],"large":[55],"attraction":[56],"basins.":[57],"In":[58],"paper,":[60],"we":[61],"present":[62],"planner":[66,108,113],"combining":[67],"\"smart\"":[68],"escape":[69],"motions":[70],"from":[71],"parallel":[75],"computation":[76],"improve":[78],"overall":[79],"performance.":[80],"The":[81],"results":[82],"obtained":[83],"show":[84],"significant":[85],"improvement":[86],"time,":[89],"along":[90],"remarkable":[92],"reduction":[93],"standard":[95],"deviation.":[96],"A":[97],"performance":[98],"comparison":[99],"on":[100],"benchmark":[102],"problem":[103],"an":[110],"existing,":[111],"state-of-the-art":[112],"also":[115],"included.":[116],"Our":[117],"investigation":[118],"confirms":[119],"effectiveness":[121],"as":[125],"heuristic":[126],"difficult":[129],"problems.":[132]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}