{"id":"https://openalex.org/W4380881051","doi":"https://doi.org/10.1145/3579371.3589092","title":"Energy-Efficient Realtime Motion Planning","display_name":"Energy-Efficient Realtime Motion Planning","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380881051","doi":"https://doi.org/10.1145/3579371.3589092"},"language":"en","primary_location":{"id":"doi:10.1145/3579371.3589092","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3579371.3589092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual International Symposium on Computer Architecture","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/A5026554402","display_name":"Deval Shah","orcid":"https://orcid.org/0000-0002-1537-1686"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Deval Shah","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada"],"raw_orcid":"https://orcid.org/0000-0002-1537-1686","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065178723","display_name":"Ningfeng Yang","orcid":"https://orcid.org/0009-0003-0750-7998"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ningfeng Yang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, USA"],"raw_orcid":"https://orcid.org/0009-0003-0750-7998","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026788167","display_name":"Tor M. Aamodt","orcid":"https://orcid.org/0000-0003-1161-692X"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Tor M. Aamodt","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada"],"raw_orcid":"https://orcid.org/0000-0003-1161-692X","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026554402"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":1.5079,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.8466452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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.9954000115394592,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/speedup","display_name":"Speedup","score":0.8325304985046387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8308961391448975},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7406542301177979},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6295809149742126},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.6054646372795105},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5743061304092407},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.5099166631698608},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.47494152188301086},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4201841354370117},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.4099710285663605},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.385922372341156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24302718043327332}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8325304985046387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8308961391448975},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7406542301177979},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6295809149742126},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.6054646372795105},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5743061304092407},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.5099166631698608},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.47494152188301086},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4201841354370117},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4099710285663605},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.385922372341156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24302718043327332},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3579371.3589092","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3579371.3589092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual International Symposium on Computer Architecture","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1497695555","https://openalex.org/W1604206505","https://openalex.org/W1976418985","https://openalex.org/W1993282304","https://openalex.org/W1999250663","https://openalex.org/W2023525850","https://openalex.org/W2027931070","https://openalex.org/W2102430571","https://openalex.org/W2108643443","https://openalex.org/W2120399177","https://openalex.org/W2126539456","https://openalex.org/W2133844819","https://openalex.org/W2145882751","https://openalex.org/W2151395903","https://openalex.org/W2151931936","https://openalex.org/W2162897478","https://openalex.org/W2164062812","https://openalex.org/W2167348159","https://openalex.org/W2246023205","https://openalex.org/W2295774037","https://openalex.org/W2408916298","https://openalex.org/W2472568752","https://openalex.org/W2509023811","https://openalex.org/W2537959404","https://openalex.org/W2600024523","https://openalex.org/W2603429625","https://openalex.org/W2623521343","https://openalex.org/W2867345499","https://openalex.org/W2910152790","https://openalex.org/W2963439114","https://openalex.org/W2967969632","https://openalex.org/W2976419033","https://openalex.org/W3047385205","https://openalex.org/W3097941004","https://openalex.org/W3140875405","https://openalex.org/W3165149185","https://openalex.org/W3196508834","https://openalex.org/W3213988574","https://openalex.org/W4232019702","https://openalex.org/W4254019281","https://openalex.org/W4255097844","https://openalex.org/W4281721323"],"related_works":["https://openalex.org/W2950520577","https://openalex.org/W1554644772","https://openalex.org/W2494130044","https://openalex.org/W2003935582","https://openalex.org/W2177838837","https://openalex.org/W2963831937","https://openalex.org/W3209384898","https://openalex.org/W74409296","https://openalex.org/W1991844655","https://openalex.org/W1595834484"],"abstract_inverted_index":{"Motion":[0],"planning":[1,29,43,57,232,242],"is":[2,30],"a":[3,18,162,216,228,244,263],"fundamental":[4],"problem":[5],"in":[6,27,55,65,92,111,114,127,155,181,190,200,210,251],"autonomous":[7],"robotics":[8],"with":[9,61,187,197,218,246,253],"real-time":[10,240],"and":[11,38,59,96,169],"low-energy":[12],"requirements":[13],"for":[14,166,176,202,215,243],"safe":[15],"navigation":[16],"through":[17],"dynamic":[19],"environment.":[20,40],"More":[21],"than":[22],"90%":[23],"of":[24,71,89,108,124,153,160,221,249,257],"computation":[25,77,113,126,192,201],"time":[26],"motion":[28,42,49,56,156,231,241],"spent":[31],"on":[32,142,262],"collision":[33,66,72,208],"detection":[34,73,209],"between":[35],"the":[36,39,87,104,121,150,191],"robot":[37,217,245],"Several":[41],"approaches,":[44],"such":[45],"as":[46],"deep":[47],"learning-based":[48,230],"planning,":[50],"have":[51],"shown":[52],"significant":[53],"improvements":[54],"quality":[58],"runtime":[60],"ample":[62],"parallelism":[63,129],"available":[64],"detection.":[67],"However,":[68],"naive":[69,203],"parallelization":[70,154,186],"queries":[74],"significantly":[75,139],"increases":[76],"compared":[78,193,259],"to":[79,148,194,226,260],"sequential":[80],"execution.":[81],"In":[82],"this":[83],"work,":[84],"we":[85,145],"investigate":[86],"sources":[88,123],"redundant":[90,112,125],"computations":[91],"coarsegrained":[93],"(inter-collision":[94],"detection)":[95,99],"fine-grained":[97,128,177],"(intracollision":[98],"parallelism.":[100,116,178],"We":[101,117,223],"find":[102],"that":[103,120],"physical":[105],"spatial":[106],"locality":[107],"obstacles":[109],"results":[110,180],"coarse-grained":[115,167],"further":[118],"show":[119],"primary":[122],"are":[130,135],"easy":[131],"cases":[132],"where":[133],"objects":[134],"far":[136],"apart":[137],"or":[138],"overlapping.":[140],"Based":[141],"these":[143],"insights,":[144],"propose":[146],"MPAccel":[147,158,225,237],"improve":[149],"energy":[151],"efficiency":[152],"planning.":[157],"consists":[159],"SAS,":[161],"Spatially":[163],"Aware":[164],"Scheduler":[165],"parallelism,":[168],"CECDUs,":[170],"Cascaded":[171],"Early-exit":[172],"Collision":[173],"Detection":[174],"Units":[175],"SAS":[179],"7\u00d7":[182],"speedup":[183,196],"using":[184],"8\u00d7":[185],"6%":[188],"increase":[189,199],"3.7\u00d7":[195],"83%":[198],"parallelization.":[204],"CECDU":[205],"can":[206,238],"perform":[207],"46":[211],"--":[212],"154":[213],"cycles":[214],"6":[219],"degrees":[220,248],"freedom.":[222],"evaluate":[224],"execute":[227],"state-of-the-art":[229],"algorithm.":[233],"Our":[234],"simulations":[235],"suggest":[236],"achieve":[239],"7":[247],"freedom":[250],"0.014ms-0.49ms":[252],"an":[254],"average":[255],"latency":[256],"0.099ms":[258],"1.42ms":[261],"CPU-GPU":[264],"system.":[265]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}