{"id":"https://openalex.org/W4405778909","doi":"https://doi.org/10.1109/iros58592.2024.10802176","title":"PAAMP: Polytopic Action-Set And Motion Planning for Long Horizon Dynamic Motion Planning via Mixed Integer Linear Programming","display_name":"PAAMP: Polytopic Action-Set And Motion Planning for Long Horizon Dynamic Motion Planning via Mixed Integer Linear Programming","publication_year":2024,"publication_date":"2024-10-14","ids":{"openalex":"https://openalex.org/W4405778909","doi":"https://doi.org/10.1109/iros58592.2024.10802176"},"language":"en","primary_location":{"id":"doi:10.1109/iros58592.2024.10802176","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10802176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5094207471","display_name":"Akshay Jaitly","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Akshay Jaitly","raw_affiliation_strings":["Worcester Polytechnic Institute,Robotics Engineering Department,Worcester,MA,USA,01609"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Robotics Engineering Department,Worcester,MA,USA,01609","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084689056","display_name":"Siavash Farzan","orcid":"https://orcid.org/0000-0001-6415-5560"},"institutions":[{"id":"https://openalex.org/I149919469","display_name":"California Polytechnic State University","ror":"https://ror.org/001gpfp45","country_code":"US","type":"education","lineage":["https://openalex.org/I149919469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siavash Farzan","raw_affiliation_strings":["California Polytechnic State University,Electrical Engineering Department,San Luis Obispo,CA,USA,93407"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California Polytechnic State University,Electrical Engineering Department,San Luis Obispo,CA,USA,93407","institution_ids":["https://openalex.org/I149919469"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"7617","last_page":"7624"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9763000011444092,"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/integer-programming","display_name":"Integer programming","score":0.7056210041046143},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.6401179432868958},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.633306622505188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5926000475883484},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5903424620628357},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.5716283321380615},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5579831600189209},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5228229761123657},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5168235898017883},{"id":"https://openalex.org/keywords/horizon","display_name":"Horizon","score":0.5044325590133667},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.47577205300331116},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45341289043426514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2660871744155884},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26330479979515076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20683521032333374},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.07692867517471313},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07113456726074219},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06855902075767517}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7056210041046143},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.6401179432868958},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.633306622505188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5926000475883484},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5903424620628357},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.5716283321380615},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5579831600189209},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5228229761123657},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5168235898017883},{"id":"https://openalex.org/C159176650","wikidata":"https://www.wikidata.org/wiki/Q43261","display_name":"Horizon","level":2,"score":0.5044325590133667},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47577205300331116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45341289043426514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2660871744155884},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26330479979515076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20683521032333374},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.07692867517471313},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07113456726074219},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06855902075767517},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros58592.2024.10802176","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10802176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1030513622","https://openalex.org/W2031738727","https://openalex.org/W2077007971","https://openalex.org/W2131058166","https://openalex.org/W2158194084","https://openalex.org/W2767578104","https://openalex.org/W2908852893","https://openalex.org/W3123076862","https://openalex.org/W3128894241","https://openalex.org/W3150384095","https://openalex.org/W3207111613","https://openalex.org/W4240374930","https://openalex.org/W4319348618","https://openalex.org/W4385430502","https://openalex.org/W4385894297","https://openalex.org/W4388692454","https://openalex.org/W4401414183","https://openalex.org/W6740789733","https://openalex.org/W6851365516"],"related_works":["https://openalex.org/W2906267174","https://openalex.org/W134501823","https://openalex.org/W2295626654","https://openalex.org/W2013239059","https://openalex.org/W4286622840","https://openalex.org/W2536121351","https://openalex.org/W2809608782","https://openalex.org/W2333245620","https://openalex.org/W1889576908","https://openalex.org/W3147633063"],"abstract_inverted_index":{"Optimization":[0],"methods":[1,18],"for":[2,104,117],"long-horizon,":[3],"dynamically":[4,63],"feasible":[5,64],"motion":[6,65,78,120],"planning":[7,66,79,121],"in":[8,128],"robotics":[9],"tackle":[10],"challenging":[11],"nonconvex":[12],"and":[13,95,122,130,136],"discontinuous":[14],"optimization":[15],"problems.":[16,28],"Traditional":[17],"often":[19],"falter":[20],"due":[21],"to":[22,45,76],"the":[23,38,61,89],"nonlinear":[24],"characteristics":[25],"of":[26,37,55,91],"these":[27],"We":[29,87],"introduce":[30],"a":[31,52,69,81,92,105],"technique":[32],"that":[33],"utilizes":[34],"learned":[35],"representations":[36],"system,":[39],"known":[40],"as":[41,80,108,110,134],"Polytopic":[42,56,93],"Action":[43,57],"Sets,":[44,58],"efficiently":[46],"compute":[47],"long-horizon":[48,62,123],"trajectories.":[49],"By":[50],"employing":[51],"suitable":[53],"sequence":[54],"we":[59],"transform":[60],"problem":[67],"into":[68],"Linear":[70,84],"Program.":[71],"This":[72,113],"reformulation":[73],"enables":[74],"us":[75],"address":[77],"Mixed":[82],"Integer":[83],"Program":[85],"(MILP).":[86],"demonstrate":[88],"effectiveness":[90],"Action-Set":[94],"Motion":[96],"Planning":[97],"(PAAMP)":[98],"approach":[99,114],"by":[100],"identifying":[101],"swing-up":[102],"motions":[103],"torque-constrained":[106],"pendulum":[107],"fast":[109],"0.75":[111],"milliseconds.":[112],"is":[115],"well-suited":[116],"solving":[118],"complex":[119],"Constraint":[124],"Satisfaction":[125],"Problems":[126],"(CSPs)":[127],"dynamic":[129],"underactuated":[131],"systems":[132],"such":[133],"legged":[135],"aerial":[137],"robots.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}