{"id":"https://openalex.org/W2269218225","doi":"https://doi.org/10.5220/0005529302590266","title":"A Physics-based Optimization Approach for Path Planning on Rough Terrains","display_name":"A Physics-based Optimization Approach for Path Planning on Rough Terrains","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2269218225","doi":"https://doi.org/10.5220/0005529302590266","mag":"2269218225"},"language":"en","primary_location":{"id":"doi:10.5220/0005529302590266","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005529302590266","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005529302590266","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089530520","display_name":"Diogo Amorim","orcid":null},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]},{"id":"https://openalex.org/I4210166615","display_name":"INESC TEC","ror":"https://ror.org/05fa8ka61","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590","https://openalex.org/I4210166615"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Diogo Amorim","raw_affiliation_strings":["Institute for Systems and Robotics, Instituto Superior T\u00e9cnico and Universidade de Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"Institute for Systems and Robotics, Instituto Superior T\u00e9cnico and Universidade de Lisboa, Portugal","institution_ids":["https://openalex.org/I4210166615","https://openalex.org/I141596103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052413681","display_name":"Rodrigo Ventura","orcid":"https://orcid.org/0000-0002-5655-9562"},"institutions":[{"id":"https://openalex.org/I4210166615","display_name":"INESC TEC","ror":"https://ror.org/05fa8ka61","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590","https://openalex.org/I4210166615"]},{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Rodrigo Ventura","raw_affiliation_strings":["Institute for Systems and Robotics, Instituto Superior T\u00e9cnico and Universidade de Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"Institute for Systems and Robotics, Instituto Superior T\u00e9cnico and Universidade de Lisboa, Portugal","institution_ids":["https://openalex.org/I4210166615","https://openalex.org/I141596103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089530520"],"corresponding_institution_ids":["https://openalex.org/I141596103","https://openalex.org/I4210166615"],"apc_list":null,"apc_paid":null,"fwci":0.3682,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69880406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"259","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":0.9997000098228455,"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.9997000098228455,"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.9531999826431274,"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/T11694","display_name":"Fluid Dynamics Simulations and Interactions","score":0.9470000267028809,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/motion-planning","display_name":"Motion planning","score":0.8115059733390808},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6815297603607178},{"id":"https://openalex.org/keywords/fast-marching-method","display_name":"Fast marching method","score":0.6771515607833862},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.6483454704284668},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6143696308135986},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6080591678619385},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5773631930351257},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5586430430412292},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5193201303482056},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.47881990671157837},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4674314856529236},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4560657739639282},{"id":"https://openalex.org/keywords/start-point","display_name":"Start point","score":0.41417279839515686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30661746859550476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27222704887390137},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26455336809158325},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13317787647247314},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10839459300041199},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10367336869239807}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8115059733390808},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6815297603607178},{"id":"https://openalex.org/C17866373","wikidata":"https://www.wikidata.org/wiki/Q5437042","display_name":"Fast marching method","level":2,"score":0.6771515607833862},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.6483454704284668},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6143696308135986},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6080591678619385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5773631930351257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5586430430412292},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5193201303482056},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.47881990671157837},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4674314856529236},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4560657739639282},{"id":"https://openalex.org/C2779859299","wikidata":"https://www.wikidata.org/wiki/Q7602527","display_name":"Start point","level":3,"score":0.41417279839515686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30661746859550476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27222704887390137},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26455336809158325},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13317787647247314},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10839459300041199},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10367336869239807},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0005529302590266","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005529302590266","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0005529302590266","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005529302590266","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4388726836","https://openalex.org/W2368795992","https://openalex.org/W4385636452","https://openalex.org/W1486528248","https://openalex.org/W4297609318","https://openalex.org/W2359815290","https://openalex.org/W3212258255","https://openalex.org/W2914610299","https://openalex.org/W4328027920","https://openalex.org/W2969655980"],"abstract_inverted_index":{"The":[0,39,271],"following":[1],"paper":[2],"addresses":[3,42],"the":[4,23,31,36,43,52,56,65,70,73,76,79,96,105,113,116,121,150,155,161,191,200,203,206,217,222,225,241,244,252,254,258,265,274,282,288],"problem":[5,44,93,209],"of":[6,45,55,75,115,118,157,175,202,224],"applying":[7],"existing":[8],"path":[9,16,32,46,127,134,246,280],"planning":[10,17,47,128],"methods":[11,18,129],"targeting":[12],"rough":[13,49],"terrains.":[14],"Most":[15],"for":[19,130],"mobile":[20],"robots":[21],"divide":[22],"environment":[24,57],"in":[25,160,167,197,263],"two":[26,126],"areas\u2014free":[27],"and":[28,63,72,103,112,143,267],"occupied\u2014and":[29],"restrict":[30],"to":[33,60,120,135,169,184,190,195,215,281],"lie":[34],"within":[35],"free":[37,174],"space.":[38],"presented":[40],"solution":[41],"on":[48,291],"terrains,":[50],"where":[51],"local":[53,176],"shape":[54],"are":[58],"used":[59,183,262],"both":[61,69],"constrain":[62],"optimize":[64],"resulting":[66,245],"path.":[67],"Finding":[68],"feasibility":[71],"cost":[74,156],"robot":[77,97],"crossing":[78],"terrain":[80],"at":[81,98],"a":[82,99,132,136,165,171,187,278],"given":[83,100,137],"point":[84,193],"is":[85,277],"cast":[86],"as":[87,234,240],"an":[88],"optimization":[89],"problem.":[90],"Intuitively,":[91],"this":[92],"models":[94],"dropping":[95],"location":[101],"(x,y)":[102],"determining":[104,154],"minimal":[106],"potential":[107,172],"energy":[108],"pose":[109],"(attitude":[110],"angles":[111],"distance":[114],"centre":[117],"mass":[119],"ground).":[122],"We":[123],"then":[124,181],"applied":[125],"computing":[131],"feasible":[133,279],"goal:":[138],"Fast":[139],"Marching":[140],"Method":[141],"(FMM)":[142],"Rapidly":[144],"exploring":[145],"Random":[146],"Tree":[147],"(RRT).":[148],"Processing":[149],"whole":[151],"mapped":[152],"area,":[153,219],"every":[158],"cell":[159],"map,":[162],"we":[163,212,286],"apply":[164],"FMM":[166,242,259],"order":[168],"obtain":[170],"field":[173,179],"minima.":[177],"This":[178,228],"can":[180],"be":[182,249,261],"either":[185],"pre-compute":[186],"complete":[188],"trajectory":[189],"goal":[192,283],"or":[194,238],"control,":[196],"real":[198],"time,":[199],"locomotion":[201],"robot.":[204],"Solving":[205],"previously":[207],"stated":[208],"using":[210],"RRT":[211,275],"need":[213],"not":[214,232,248],"process":[216],"entire":[218],"but":[220,243],"only":[221],"coordinates":[223],"nodes":[226],"generated.":[227],"last":[229],"approach":[230,290],"does":[231],"require":[233],"much":[235],"computational":[236],"power":[237],"time":[239],"might":[247],"optimal.":[250],"In":[251],"end,":[253],"results":[255],"obtained":[256],"from":[257,273],"may":[260],"controlling":[264],"vehicle":[266],"show":[268],"optimal":[269],"paths.":[270],"output":[272],"method":[276],"position.":[284],"Finally,":[285],"validate":[287],"proposed":[289],"four":[292],"example":[293],"environments.":[294]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}