Motion planning for multiple robots with multi-mode operations via disjunctive graphs
暂无分享,去创建一个
[1] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[2] Michael Florian,et al. An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .
[3] J. Lenstra,et al. Job-Shop Scheduling by Implicit Enumeration , 1977 .
[4] Michael Florian,et al. A Direct Search Method to Locate Negative Cycles in a Graph , 1971 .
[5] Egon Balas,et al. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..
[6] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[7] Harold H. Greenberg. A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..
[8] George L. Nemhauser,et al. A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .
[9] Narendra Ahuja,et al. PATH PLANNING IN A THREE DIMENSIONAL ENVIRONMENT. , 1984 .
[10] Tomás Lozano-Pérez,et al. On multiple moving objects , 2005, Algorithmica.
[11] John W. Boyse,et al. Interference detection among solids and surfaces , 1979, CACM.
[12] T. E. Moore,et al. An Implicit Enumeration Algorithm for the Nonpreemptive Shop Scheduling Problem , 1974 .
[13] S. Zucker,et al. Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .
[14] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[15] Hanan Samet,et al. A hierarchical strategy for path planning among moving obstacles [mobile robot] , 1989, IEEE Trans. Robotics Autom..