{"id":"https://openalex.org/W7133499837","doi":"https://doi.org/10.48550/arxiv.2603.02989","title":"CASSR: Continuous A-Star Search through Reachability for real time footstep planning","display_name":"CASSR: Continuous A-Star Search through Reachability for real time footstep planning","publication_year":2026,"publication_date":"2026-03-03","ids":{"openalex":"https://openalex.org/W7133499837","doi":"https://doi.org/10.48550/arxiv.2603.02989"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.02989","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128090255","display_name":"Jiayi Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wang, Jiayi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128096888","display_name":"Steve Tonneau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tonneau, Steve","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5128090255"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.7404999732971191,"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"}},"topics":[{"id":"https://openalex.org/T10879","display_name":"Robotic Locomotion and Control","score":0.7404999732971191,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.11010000109672546,"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/T12290","display_name":"Human Motion and Animation","score":0.04910000041127205,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/reachability","display_name":"Reachability","score":0.8726999759674072},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5842000246047974},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.5031999945640564},{"id":"https://openalex.org/keywords/hybrid-system","display_name":"Hybrid system","score":0.33869999647140503},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.33709999918937683},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.3077999949455261}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8726999759674072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6349999904632568},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5842000246047974},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.5031999945640564},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4341000020503998},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3653999865055084},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.33869999647140503},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.33709999918937683},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3206000030040741},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30329999327659607},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.27129998803138733},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.25589999556541443}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.02989","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.02989","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.02989","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.02989","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6126575469970703}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Footstep":[0],"planning":[1,113],"involves":[2],"a":[3,33,43,53,91,98],"challenging":[4],"combinatorial":[5],"search.":[6,50],"Traditional":[7],"A*":[8,49,87],"approaches":[9],"require":[10],"discretising":[11],"reachability":[12],"constraints,":[13],"while":[14,95],"Mixed-Integer":[15],"Programming":[16],"(MIP)":[17],"supports":[18],"continuous":[19,40],"formulations":[20,41],"but":[21],"quickly":[22],"becomes":[23],"intractable,":[24],"especially":[25],"when":[26],"rotations":[27],"are":[28],"included.":[29],"We":[30],"present":[31],"CASSR,":[32],"novel":[34],"framework":[35],"that":[36,82,105],"recursively":[37],"propagates":[38],"convex,":[39],"of":[42,67,93],"robot's":[44],"kinematic":[45],"constraints":[46],"within":[47],"an":[48],"Combined":[51],"with":[52],"new":[54],"cost-to-go":[55],"heuristic":[56],"based":[57],"on":[58,77],"the":[59],"EPA":[60],"algorithm,":[61],"CASSR":[62,83,106],"efficiently":[63],"plans":[64],"contact":[65],"sequences":[66],"up":[68,89],"to":[69,90],"30":[70],"footsteps":[71],"in":[72],"under":[73],"125":[74],"ms.":[75],"Experiments":[76],"biped":[78,115],"locomotion":[79],"tasks":[80],"demonstrate":[81],"outperforms":[84],"traditional":[85],"discretised":[86],"by":[88],"factor":[92],"100,":[94],"also":[96],"surpassing":[97],"commercial":[99],"MIP":[100],"solver.":[101],"These":[102],"results":[103],"show":[104],"enables":[107],"fast,":[108],"reliable,":[109],"and":[110],"real-time":[111],"footstep":[112],"for":[114],"robots.":[116]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-03-05T00:00:00"}