{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/29165"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/29165","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Multiple autonomous vehicle mission planning and management","abstract":"This thesis investigates multiple autonomous vehicle mission planning and management. It begins by introducing the basic concepts and objectives of the multivehicle mission-planning problem. Then it formulates the problem mathematically and analyzes parameters in the objective function. The solution approach uses a hierarchical mission-planning scheme to take advantage of a scalable architecture. We develop a heuristic-based algorithm to solve the multiple-vehicle mission-planning problem. The algorithm has two phases: goal-point partitioning and routing. Goal-point partitioning uses a sweep procedure to group goal-points. Routing uses an implementation of simulated annealing combined with well-known TSP heuristics. Through the computational experiments conducted on both traveling salesman problem test cases, the TSPLIB library, and randomly generated test data, the routing algorithm performs quite well. It has been able to find TSP tours within one percent of optimality, and typically within one-half of one percent. The integration of the two-phase approach provides a solution to the multiple autonomous vehicle mission planning problem.","abstract_html":"This thesis investigates multiple autonomous vehicle mission planning and management. It begins by introducing the basic concepts and objectives of the multivehicle mission-planning problem. Then it formulates the problem mathematically and analyzes parameters in the objective function. The solution approach uses a hierarchical mission-planning scheme to take advantage of a scalable architecture. We develop a heuristic-based algorithm to solve the multiple-vehicle mission-planning problem. The algorithm has two phases: goal-point partitioning and routing. Goal-point partitioning uses a sweep procedure to group goal-points. Routing uses an implementation of simulated annealing combined with well-known TSP heuristics. Through the computational experiments conducted on both traveling salesman problem test cases, the TSPLIB library, and randomly generated test data, the routing algorithm performs quite well. It has been able to find TSP tours within one percent of optimality, and typically within one-half of one percent. The integration of the two-phase approach provides a solution to the multiple autonomous vehicle mission planning problem.","abstract_has_math":false,"creators":["Zhao, Wei"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"System Design and Management Program.","school":null,"contributors":[],"advisors":["Thomas Magnanti and Stephan Kolitz."],"committee_chairs":[],"committee_members":[],"year":1999,"date_issued":"1999","date_published":"1999","updated_at":"2026-07-22T22:21:59Z","subjects":["System Design and Management Program."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/29165","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Thomas Magnanti and Stephan Kolitz."]},{"key":"dc:contributor.department","label":"Department","values":["System Design and Management Program."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["System Design and Management Program."]},{"key":"dc:creator","label":"Author","values":["Zhao, Wei"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-09-27T21:00:10Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-09-27T21:00:10Z"]},{"key":"dc:date.issued","label":"Date","values":["1999"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["System Design and Management Program."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/29165"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (S.M.)--Massachusetts Institute of Technology, System Design & Management Program, 1999.","Includes bibliographical references (leaves 83-85)."]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis investigates multiple autonomous vehicle mission planning and management. It begins by introducing the basic concepts and objectives of the multivehicle mission-planning problem. Then it formulates the problem mathematically and analyzes parameters in the objective function. The solution approach uses a hierarchical mission-planning scheme to take advantage of a scalable architecture. We develop a heuristic-based algorithm to solve the multiple-vehicle mission-planning problem. The algorithm has two phases: goal-point partitioning and routing. Goal-point partitioning uses a sweep procedure to group goal-points. Routing uses an implementation of simulated annealing combined with well-known TSP heuristics. Through the computational experiments conducted on both traveling salesman problem test cases, the TSPLIB library, and randomly generated test data, the routing algorithm performs quite well. It has been able to find TSP tours within one percent of optimality, and typically within one-half of one percent. The integration of the two-phase approach provides a solution to the multiple autonomous vehicle mission planning problem."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Multiple autonomous vehicle mission planning and management"]}]}],"canonical_facts":{"dc:contributor.advisor":["Thomas Magnanti and Stephan Kolitz."],"dc:contributor.department":["System Design and Management Program."],"dc:contributor.other":["System Design and Management Program."],"dc:creator":["Zhao, Wei"],"dc:date.accessioned":["2005-09-27T21:00:10Z"],"dc:date.available":["2005-09-27T21:00:10Z"],"dc:date.issued":["1999"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, System Design & Management Program, 1999.","Includes bibliographical references (leaves 83-85)."],"dc:description.abstract":["This thesis investigates multiple autonomous vehicle mission planning and management. It begins by introducing the basic concepts and objectives of the multivehicle mission-planning problem. Then it formulates the problem mathematically and analyzes parameters in the objective function. The solution approach uses a hierarchical mission-planning scheme to take advantage of a scalable architecture. We develop a heuristic-based algorithm to solve the multiple-vehicle mission-planning problem. The algorithm has two phases: goal-point partitioning and routing. Goal-point partitioning uses a sweep procedure to group goal-points. Routing uses an implementation of simulated annealing combined with well-known TSP heuristics. Through the computational experiments conducted on both traveling salesman problem test cases, the TSPLIB library, and randomly generated test data, the routing algorithm performs quite well. It has been able to find TSP tours within one percent of optimality, and typically within one-half of one percent. The integration of the two-phase approach provides a solution to the multiple autonomous vehicle mission planning problem."],"dc:description.degree":["S.M."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/29165"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["System Design and Management Program."],"dc:title":["Multiple autonomous vehicle mission planning and management"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:59Z"}