{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:33:19Z","timestamp":1780763599455,"version":"3.54.1"},"reference-count":46,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/iros40897.2019.8968479","type":"proceedings-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T23:53:51Z","timestamp":1580428431000},"page":"1890-1897","source":"Crossref","is-referenced-by-count":11,"title":["Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles, Best Practices, and Applications"],"prefix":"10.1109","author":[{"given":"Shuai D.","family":"Han","sequence":"first","affiliation":[{"name":"Rutgers, the State University of New Jersey,Department of Computer Science,Piscataway,NJ,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingjin","family":"Yu","sequence":"additional","affiliation":[{"name":"Rutgers, the State University of New Jersey,Department of Computer Science,Piscataway,NJ,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759330"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2603528"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v32i1.12100","article-title":"Improved results for minimum constraint removal","author":"eiben","year":"2018","journal-title":"AAAI"},{"key":"ref32","article-title":"Computational tradeoffs of search methods for minimum constraint removal paths","author":"krontiris","year":"2015","journal-title":"Eighth Annual Symposium on Combinatorial Search"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-319-16595-0_11","article-title":"Ffrob: An efficient heuristic for task and motion planning","author":"garrett","year":"2015","journal-title":"Algorithmic Foundations of Robotics XI"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760374"},{"key":"ref37","article-title":"Optimal tourist problem and anytime planning of trip itineraries","author":"yu","year":"2014","journal-title":"arXiv preprint arXiv 1409 8536"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593450"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.045"},{"key":"ref34","author":"lawler","year":"1985","journal-title":"The traveling salesman problem 1985"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICUAS.2016.7502523"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CASE.2011.6042462"},{"key":"ref12","first-page":"278364918780999","article-title":"Complexity results and fast methods for optimal tabletop rearrangement with overhand grasps","author":"han","year":"2017","journal-title":"The International Journal of Robotics Research"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509502"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307146"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-009-0153-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008937911390"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1177\/0278364905059067"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1995.525802"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICAR.1997.620182"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918761570"},{"key":"ref4","first-page":"8","article-title":"Integer programming and combinatorial optimization","volume":"20","author":"nemhauser","year":"1992","journal-title":"Constraint Classification for Mixed Integer Programming Formulations COAL Bulletin"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6943079"},{"key":"ref3","author":"dantzig","year":"2016","journal-title":"Linear Programming and Extensions"},{"key":"ref6","article-title":"Integer programming and network flows","author":"hu","year":"1969","journal-title":"Technical Report Computer Sciences Dept Univ of Wisconsin-Madison"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487581"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2001.7076321"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1977.1101500"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2015.2503143"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364905051974"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913507795"},{"key":"ref46","article-title":"k-color multi-robot motion planning","author":"solovey","year":"2012","journal-title":"Proceedings Workshop on Algorithmic Foundations of Robotics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ROMAN.2012.6343737"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594417"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v27i1.8592","article-title":"A general formal framework for pathfinding problems with multiple agents","author":"erdem","year":"2013","journal-title":"AAAI"},{"key":"ref21","article-title":"Towards optimal cooperative path planning in hard setups through satisfiability solving","author":"surynek","year":"2012","journal-title":"Proc 4 Pacific Rim International Conference on Artificial Intelligence"},{"key":"ref42","year":"2014","journal-title":"Gurobi Optimizer Reference Manual"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref41","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref23","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"2011","journal-title":"Proceedings International Joint Conference on Artificial Intelligence"},{"key":"ref44","year":"0","journal-title":"GNU Linear Programming Kit"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/58"},{"key":"ref43","year":"0","journal-title":"IBM ILOG CPLEX Optimization Studio"},{"key":"ref25","article-title":"Icbs: The improved conflict-based search algorithm for multi-agent pathfinding","author":"boyarski","year":"2015","journal-title":"Eighth Annual Symposium on Combinatorial Search"}],"event":{"name":"2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","location":"Macau, China","start":{"date-parts":[[2019,11,3]]},"end":{"date-parts":[[2019,11,8]]}},"container-title":["2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8957008\/8967518\/08968479.pdf?arnumber=8968479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T18:24:26Z","timestamp":1753813466000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8968479\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/iros40897.2019.8968479","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}