{"id":"https://openalex.org/W3037479385","doi":"https://doi.org/10.2312/egp.20201037","title":"Integrating Local Collision Avoidance with Shortest Path Maps","display_name":"Integrating Local Collision Avoidance with Shortest Path Maps","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3037479385","doi":"https://doi.org/10.2312/egp.20201037","mag":"3037479385"},"language":"en","primary_location":{"id":"doi:10.2312/egp.20201037","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egp.20201037","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/egp.20201037","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035200740","display_name":"Ritesh Sharma","orcid":"https://orcid.org/0000-0002-8542-5096"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sharma, Ritesh","raw_affiliation_strings":["University of California, Merced, Merced, United States"],"affiliations":[{"raw_affiliation_string":"University of California, Merced, Merced, United States","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064604007","display_name":"Renato Farias","orcid":"https://orcid.org/0000-0002-5936-1834"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Farias, Renato","raw_affiliation_strings":["University of California, Merced, Merced, United States"],"affiliations":[{"raw_affiliation_string":"University of California, Merced, Merced, United States","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070306914","display_name":"Marcelo Kallmann","orcid":"https://orcid.org/0000-0001-5138-0603"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kallmann, Marcelo","raw_affiliation_strings":["University of California, Merced, Merced, United States"],"affiliations":[{"raw_affiliation_string":"University of California, Merced, Merced, United States","institution_ids":["https://openalex.org/I156087764"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035200740"],"corresponding_institution_ids":["https://openalex.org/I156087764"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05942058,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.993399977684021,"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"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/collision-avoidance","display_name":"Collision avoidance","score":0.7844593524932861},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6215128898620605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6013738512992859},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4277111291885376},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4164160490036011},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3512069880962372},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25992196798324585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1969362497329712},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.14881637692451477},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.126033216714859}],"concepts":[{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.7844593524932861},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6215128898620605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6013738512992859},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4277111291885376},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4164160490036011},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3512069880962372},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25992196798324585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1969362497329712},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.14881637692451477},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.126033216714859}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/egp.20201037","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egp.20201037","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.2312/egp.20201037","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egp.20201037","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","score":0.6100000143051147,"display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2142943472"],"related_works":["https://openalex.org/W2523218731","https://openalex.org/W2096193171","https://openalex.org/W2118203388","https://openalex.org/W2858289757","https://openalex.org/W2162369036","https://openalex.org/W2566931281","https://openalex.org/W2233443833","https://openalex.org/W2541693177","https://openalex.org/W195052197","https://openalex.org/W2584834915","https://openalex.org/W3174175410","https://openalex.org/W2756258291","https://openalex.org/W2148872350","https://openalex.org/W2927790691","https://openalex.org/W2759085060","https://openalex.org/W2980638093","https://openalex.org/W2039499110","https://openalex.org/W2373563662","https://openalex.org/W300048707","https://openalex.org/W2111496734"],"abstract_inverted_index":{"The":[0],"effective":[1],"integration":[2],"of":[3,35],"local":[4,42],"collision":[5,43],"avoidance":[6,44],"with":[7,41],"global":[8],"path":[9],"planning":[10],"becomes":[11],"a":[12],"necessity":[13],"when":[14],"multi-agent":[15],"systems":[16],"need":[17],"to":[18,47,53],"be":[19],"simulated":[20],"in":[21,45],"complex":[22],"cluttered":[23],"environments.":[24],"This":[25],"work":[26],"presents":[27],"our":[28],"first":[29],"results":[30],"exploring":[31],"the":[32],"new":[33],"approach":[34],"integrating":[36],"Shortest":[37],"Path":[38],"Maps":[39],"(SPMs)":[40],"order":[46],"provide":[48],"optimal":[49],"paths":[50],"for":[51],"agents":[52],"navigate":[54],"around":[55],"obstacles":[56],"toward":[57],"their":[58],"goal":[59],"locations.":[60],"Our":[61],"GPU-based":[62],"SPM":[63],"implementation":[64],"is":[65],"available.":[66]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}