{"id":"https://openalex.org/W4380434642","doi":"https://doi.org/10.1109/lcsys.2023.3285746","title":"Dynamic and Nonlinear Programming for Trajectory Planning","display_name":"Dynamic and Nonlinear Programming for Trajectory Planning","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4380434642","doi":"https://doi.org/10.1109/lcsys.2023.3285746"},"language":"en","primary_location":{"id":"doi:10.1109/lcsys.2023.3285746","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2023.3285746","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-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/A5076138208","display_name":"Andreas Britzelmeier","orcid":"https://orcid.org/0000-0003-3885-7715"},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Britzelmeier","raw_affiliation_strings":["Department of Aerospace Engineering, Institute of Applied Mathematics and Scientific Computing, University of the Bundeswehr Munich, Neubiberg, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3885-7715","affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, Institute of Applied Mathematics and Scientific Computing, University of the Bundeswehr Munich, Neubiberg, Germany","institution_ids":["https://openalex.org/I40527276"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069602662","display_name":"Alberto De Marchi","orcid":"https://orcid.org/0000-0002-3545-6898"},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alberto De Marchi","raw_affiliation_strings":["Department of Aerospace Engineering, Institute of Applied Mathematics and Scientific Computing, University of the Bundeswehr Munich, Neubiberg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3545-6898","affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, Institute of Applied Mathematics and Scientific Computing, University of the Bundeswehr Munich, Neubiberg, Germany","institution_ids":["https://openalex.org/I40527276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036029855","display_name":"Rebecca Richter","orcid":null},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rebecca Richter","raw_affiliation_strings":["Department of Aerospace Engineering, Institute of Applied Mathematics and Scientific Computing, University of the Bundeswehr Munich, Neubiberg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, Institute of Applied Mathematics and Scientific Computing, University of the Bundeswehr Munich, Neubiberg, Germany","institution_ids":["https://openalex.org/I40527276"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40527276"],"apc_list":null,"apc_paid":null,"fwci":1.4124,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.81322422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"7","issue":null,"first_page":"2569","last_page":"2574"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9932000041007996,"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/T12288","display_name":"Optimization and Search Problems","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pointwise","display_name":"Pointwise","score":0.7669645547866821},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6722535490989685},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6670125126838684},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.6492974162101746},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6417074203491211},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6208441257476807},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6145632266998291},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.4818781316280365},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4667012691497803},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46647152304649353},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46109190583229065},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4241662323474884},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4141422510147095},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.3458596467971802},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.32097384333610535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28887778520584106},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16806086897850037},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16168272495269775}],"concepts":[{"id":"https://openalex.org/C2777984123","wikidata":"https://www.wikidata.org/wiki/Q9248237","display_name":"Pointwise","level":2,"score":0.7669645547866821},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6722535490989685},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6670125126838684},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.6492974162101746},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6417074203491211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6208441257476807},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6145632266998291},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.4818781316280365},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4667012691497803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46647152304649353},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46109190583229065},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4241662323474884},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4141422510147095},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3458596467971802},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.32097384333610535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28887778520584106},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16806086897850037},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16168272495269775},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcsys.2023.3285746","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2023.3285746","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W634094752","https://openalex.org/W1552830313","https://openalex.org/W1964946446","https://openalex.org/W1983585926","https://openalex.org/W2055201760","https://openalex.org/W2123871098","https://openalex.org/W2129486961","https://openalex.org/W2142224528","https://openalex.org/W2158370675","https://openalex.org/W2161819990","https://openalex.org/W2166316739","https://openalex.org/W2303961898","https://openalex.org/W2529220408","https://openalex.org/W2903465896","https://openalex.org/W2967267347","https://openalex.org/W3004162504","https://openalex.org/W3092426941","https://openalex.org/W3105372678","https://openalex.org/W3128381983","https://openalex.org/W3139334869","https://openalex.org/W3200418126","https://openalex.org/W4205439813","https://openalex.org/W4206004106","https://openalex.org/W4365790399","https://openalex.org/W4385451933","https://openalex.org/W6854976603"],"related_works":["https://openalex.org/W2005695917","https://openalex.org/W2333571655","https://openalex.org/W3004930912","https://openalex.org/W2104320275","https://openalex.org/W2111158727","https://openalex.org/W1510039162","https://openalex.org/W2112736381","https://openalex.org/W2106317420","https://openalex.org/W2120794627","https://openalex.org/W2107702345"],"abstract_inverted_index":{"Direct":[0],"optimal":[1],"control":[2],"techniques,":[3],"relying":[4],"on":[5,141],"numerical":[6,139],"methods":[7,59],"for":[8,88,123,131],"constrained":[9],"optimization,":[10,116],"are":[11,81,95],"typically":[12],"used":[13],"in":[14,18,76,147],"trajectory":[15,63,115],"planning":[16,64],"tasks":[17],"high-dimensional":[19,90],"spaces.":[20],"However,":[21],"general-purpose":[22],"solvers":[23],"often":[24],"fail":[25],"to":[26,52,60,70,105],"find":[27],"a":[28,72,77,89,99,142,148],"feasible":[29],"solution":[30],"when":[31],"facing":[32],"cluttered":[33],"environments.":[34],"Sampling-or":[35],"graph-based":[36],"methods,":[37],"instead,":[38],"can":[39],"explore":[40],"complex":[41],"configuration":[42],"spaces":[43],"but":[44],"struggle":[45],"with":[46],"dynamic":[47,54],"constraints.":[48],"Here,":[49],"we":[50,67],"propose":[51],"combine":[53],"programming":[55],"(DP)":[56],"and":[57,114,125],"derivative-based":[58],"reliably":[61],"solve":[62],"problems.":[65],"Specifically,":[66],"exploit":[68],"DP":[69,124],"generate":[71],"sequence":[73],"of":[74,121],"waypoints":[75],"lowdimensional":[78],"space,":[79],"which":[80],"then":[82,96],"encoded":[83],"as":[84,98,129],"pointwise":[85],"path":[86,113],"constraints":[87],"trajectory,":[91],"whose":[92],"constraint":[93],"violations":[94],"represented":[97],"penalty":[100],"within":[101],"the":[102,107,119],"Bellman":[103],"equation":[104],"recompute":[106],"waypoints.":[108],"This":[109],"iterative":[110],"approach,":[111],"alternating":[112],"avoids":[117],"both":[118],"curse":[120],"dimensionality":[122],"problematic":[126],"nonconvexities":[127],"(such":[128],"obstacles)":[130],"motion":[132],"planning.":[133],"We":[134],"demonstrate":[135],"our":[136],"strategy":[137],"using":[138],"experiments":[140],"six-degree-of-freedom":[143],"robotic":[144],"manipulator":[145],"moving":[146],"confined":[149],"space.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}