{"id":"https://openalex.org/W4414198784","doi":"https://doi.org/10.1109/mmar65820.2025.11151005","title":"Path Optimization Based on Time-Optimal Velocity Profile Generation","display_name":"Path Optimization Based on Time-Optimal Velocity Profile Generation","publication_year":2025,"publication_date":"2025-08-26","ids":{"openalex":"https://openalex.org/W4414198784","doi":"https://doi.org/10.1109/mmar65820.2025.11151005"},"language":"en","primary_location":{"id":"doi:10.1109/mmar65820.2025.11151005","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar65820.2025.11151005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 29th International Conference on Methods and Models in Automation and Robotics (MMAR)","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/A5075965099","display_name":"\u00c1kos Nagy","orcid":"https://orcid.org/0000-0003-0735-3127"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"\u00c1kos Nagy","raw_affiliation_strings":["Budapest University of Technology and Economics,Department of Automation and Applied Informatics,Budapest,Hungary"],"affiliations":[{"raw_affiliation_string":"Budapest University of Technology and Economics,Department of Automation and Applied Informatics,Budapest,Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075965099"],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23488488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"213","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980999827384949,"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.9980999827384949,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9765999913215637,"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"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9327999949455261,"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/path","display_name":"Path (computing)","score":0.7020999789237976},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6898000240325928},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.652400016784668},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6010000109672546},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5813000202178955},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.5447999835014343},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5117999911308289},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.36550000309944153},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.3571999967098236}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7020999789237976},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6898000240325928},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.652400016784668},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6010000109672546},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5813000202178955},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.5447999835014343},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4422999918460846},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.36550000309944153},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3630000054836273},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3571999967098236},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.3416000008583069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3310999870300293},{"id":"https://openalex.org/C145565327","wikidata":"https://www.wikidata.org/wiki/Q852514","display_name":"Motion control","level":3,"score":0.3310000002384186},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C133731056","wikidata":"https://www.wikidata.org/wiki/Q4917288","display_name":"Control engineering","level":1,"score":0.30379998683929443},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.29980000853538513},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.290800005197525},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C2776542497","wikidata":"https://www.wikidata.org/wiki/Q5266672","display_name":"Development (topology)","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.2777000069618225},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.26899999380111694},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.2648000121116638},{"id":"https://openalex.org/C65401140","wikidata":"https://www.wikidata.org/wiki/Q7353385","display_name":"Robot control","level":4,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mmar65820.2025.11151005","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar65820.2025.11151005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 29th International Conference on Methods and Models in Automation and Robotics (MMAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G633279211","display_name":null,"funder_award_id":"2022-2.1.1-NL-2022-00012,2024-2.1.1-EK\u00d6P","funder_id":"https://openalex.org/F4320326762","funder_display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal"}],"funders":[{"id":"https://openalex.org/F4320326762","display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W2035179108","https://openalex.org/W2057802165","https://openalex.org/W2083540473","https://openalex.org/W2099454002","https://openalex.org/W2136209220","https://openalex.org/W2160960847","https://openalex.org/W2166316739","https://openalex.org/W2549200707","https://openalex.org/W2766852415","https://openalex.org/W2952959982","https://openalex.org/W4312526866","https://openalex.org/W4388868804","https://openalex.org/W4406079894"],"related_works":[],"abstract_inverted_index":{"Mathematical":[0],"optimization-based":[1],"techniques":[2],"are":[3],"becoming":[4],"increasingly":[5],"important":[6],"in":[7,66,109],"the":[8,51,61,84,89,96,115,120],"rapidly":[9],"developing":[10],"field":[11],"of":[12,60,95,129],"robotics.":[13],"Optimization":[14],"methods":[15],"offer":[16],"unprecedented":[17],"opportunities,":[18],"from":[19,32],"control":[20],"systems":[21],"and":[22,91],"motion":[23],"planning":[24],"to":[25,114,126],"high-level":[26],"tasks.":[27],"The":[28,43,75,99],"presented":[29,76],"method":[30,77,121],"starts":[31],"an":[33,38],"initial":[34,44,80],"path":[35,41,45,81,100],"provided":[36],"by":[37],"existing":[39],"geometrical":[40],"planner.":[42],"is":[46,103],"not":[47,56,72],"yet":[48],"suitable":[49],"for":[50],"robot,":[52],"as":[53],"it":[54],"does":[55],"consider":[57],"certain":[58],"limitations":[59],"robot":[62,108],"or":[63],"may":[64],"result":[65],"too":[67],"slow":[68],"traversal":[69],"(it":[70],"would":[71],"be":[73,124],"time-optimal).":[74],"modifies":[78],"this":[79],"so":[82],"that":[83],"resulting":[85],"time-optimal":[86],"trajectory":[87],"meets":[88],"kinematic":[90],"possible":[92],"dynamic":[93],"constraints":[94],"robotic":[97],"system.":[98],"optimization":[101],"approach":[102],"validated":[104],"using":[105],"a":[106,110],"car-like":[107],"simulated":[111],"environment.":[112],"Due":[113],"applied":[116,125],"second-order":[117],"Lagrange":[118],"dynamics,":[119],"can":[122],"also":[123],"other":[127],"types":[128],"robots.":[130]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}