{"id":"https://openalex.org/W2058107561","doi":"https://doi.org/10.1109/iros.2012.6386194","title":"Parallel sampling-based motion planning with superlinear speedup","display_name":"Parallel sampling-based motion planning with superlinear speedup","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2058107561","doi":"https://doi.org/10.1109/iros.2012.6386194","mag":"2058107561"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2012.6386194","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2012.6386194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","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/A5077221893","display_name":"cJeffrey Ichnowski","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"cJeffrey Ichnowski","raw_affiliation_strings":["Department of Computer Science at the University of North Carolina at Chapel Hill, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science at the University of North Carolina at Chapel Hill, USA","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081228308","display_name":"cRon Alterovitz","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"cRon Alterovitz","raw_affiliation_strings":["Department of Computer Science at the University of North Carolina at Chapel Hill, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science at the University of North Carolina at Chapel Hill, USA","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1206","last_page":"1212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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.9847999811172485,"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.9405848383903503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8202077150344849},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7689844965934753},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6330611705780029},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.542746365070343},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48062461614608765},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4700794517993927},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.441873162984848},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.43468955159187317},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2632352411746979},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.19251665472984314}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.9405848383903503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8202077150344849},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7689844965934753},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6330611705780029},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.542746365070343},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48062461614608765},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4700794517993927},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.441873162984848},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.43468955159187317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2632352411746979},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.19251665472984314},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2012.6386194","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2012.6386194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.7241","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.7241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://robotics.cs.unc.edu/publications/Ichnowski2012_IROS.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.4099999964237213,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W110311002","https://openalex.org/W142807283","https://openalex.org/W1424654272","https://openalex.org/W1555915743","https://openalex.org/W1971086298","https://openalex.org/W2023525850","https://openalex.org/W2027693953","https://openalex.org/W2062678317","https://openalex.org/W2111994433","https://openalex.org/W2124543852","https://openalex.org/W2132973123","https://openalex.org/W2145882751","https://openalex.org/W2151395903","https://openalex.org/W2155441094","https://openalex.org/W2164062812","https://openalex.org/W2165558283","https://openalex.org/W2249637006","https://openalex.org/W2266937728","https://openalex.org/W2611243847","https://openalex.org/W2725179571","https://openalex.org/W6604465034"],"related_works":["https://openalex.org/W1537803214","https://openalex.org/W1567684443","https://openalex.org/W2123081449","https://openalex.org/W3012895752","https://openalex.org/W2177838837","https://openalex.org/W2963831937","https://openalex.org/W2748614007","https://openalex.org/W2080419754","https://openalex.org/W2185482126","https://openalex.org/W4241547419"],"abstract_inverted_index":{"We":[0,132],"present":[1],"PRRT":[2,30],"(Parallel":[3,7],"RRT)":[4],"and":[5,13,31,84,104,130,136,152],"PRRT*":[6,32],"RRT*),":[8],"sampling-based":[9],"methods":[10],"for":[11],"feasible":[12],"optimal":[14],"motion":[15],"planning":[16],"that":[17],"are":[18,42],"tailored":[19],"to":[20,33,77,89,100,108,124],"execute":[21],"on":[22],"modern":[23],"multi-core":[24],"CPUs.":[25],"Our":[26,118],"algorithmic":[27],"improvements":[28],"enable":[29],"achieve":[34,61],"a":[35,55,143,149,161],"superlinear":[36,63,137],"speedup:":[37],"when":[38],"p":[39],"processor":[40,47,95],"cores":[41],"used":[43],"instead":[44],"of":[45,93,112],"1":[46],"core,":[48],"computation":[49],"time":[50],"is":[51],"sped":[52],"up":[53],"by":[54,81],"factor":[56],"greater":[57],"than":[58],"p.":[59],"To":[60],"this":[62],"speedup,":[64],"our":[65],"algorithms":[66,120],"utilize":[67],"three":[68],"key":[69],"features:":[70],"(1)":[71,142],"lock-free":[72],"parallelism":[73],"using":[74,165],"atomic":[75],"operations":[76],"eliminate":[78],"slowdowns":[79],"caused":[80],"lock":[82],"overhead":[83],"contention,":[85],"(2)":[86,153],"partition-based":[87],"sampling":[88],"reduce":[90,109],"the":[91,110,122],"size":[92],"each":[94],"core's":[96],"working":[97],"data":[98],"set":[99],"improve":[101],"cache":[102],"efficiency,":[103],"(3)":[105],"parallel":[106,119],"backtracking":[107],"number":[111],"rewiring":[113],"steps":[114],"performed":[115],"in":[116,139,148],"PRRT*.":[117],"retain":[121],"ability":[123],"integrate":[125],"with":[126],"existing":[127],"CPU-based":[128],"libraries":[129],"algorithms.":[131],"demonstrate":[133],"fast":[134],"performance":[135],"speedups":[138],"two":[140],"scenarios:":[141],"holonomic":[144],"disc-shaped":[145],"robot":[146,159],"moving":[147],"planar":[150],"environment":[151],"an":[154],"Aldebaran":[155],"Nao":[156],"small":[157],"humanoid":[158],"performing":[160],"2-handed":[162],"manipulation":[163],"task":[164],"10":[166],"DOF.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}