{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/81713"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/81713","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Flexible schedule optimization for human-robot collaboration","abstract":"Robots are increasingly entering domains typically thought of as human-only. This convergence of human and robotic agents leads to a need for new technology to enable safe and efficient collaboration. The goal of this thesis is to develop a task allocation and scheduling algorithm for teams of robots working with or around teams of humans in intense domains where tight, fluid choreography of robotic schedules is required to guarantee the safety of all involved while maintaining high levels of productivity. Three algorithms are presented in this work: the Adaptive Preferences Algorithm, the Multi-Agent Optimization Algorithm, and Tercio. Tercio, the culminatory algorithm, is capable of assigning robots to tasks and producing near-optimal schedules for ten agents and hundreds of tasks in seconds while making guarantees about process specifications such as worker safety and deadline satisfaction. This work extends dynamic scheduling methods to incorporate flexible windows with an optimization framework featuring a mixed integer program and a satisficing hueristic scheduler. By making use of Tercio, a manufacturing facility or other high-intensity domain may fluidly command a team of robots to complete tasks in a quick, efficient manner while maintaining an ability to respond seamlessly to disturbances at execution. This greatly increases both productivity, by decreasing the time spent recompiling solutions, and responsiveness to humans in the area. These improvements in performance are displayed with multiple live demonstrations and simulations of teams of robots responding to disturbances. Tercio acts as an enabling step towards the ultimate goal of fully coordinated factories of dozens to hundreds of robots accomplishing many thousands of tasks in a safe, predictable, efficient manner.","abstract_html":"Robots are increasingly entering domains typically thought of as human-only. This convergence of human and robotic agents leads to a need for new technology to enable safe and efficient collaboration. The goal of this thesis is to develop a task allocation and scheduling algorithm for teams of robots working with or around teams of humans in intense domains where tight, fluid choreography of robotic schedules is required to guarantee the safety of all involved while maintaining high levels of productivity. Three algorithms are presented in this work: the Adaptive Preferences Algorithm, the Multi-Agent Optimization Algorithm, and Tercio. Tercio, the culminatory algorithm, is capable of assigning robots to tasks and producing near-optimal schedules for ten agents and hundreds of tasks in seconds while making guarantees about process specifications such as worker safety and deadline satisfaction. This work extends dynamic scheduling methods to incorporate flexible windows with an optimization framework featuring a mixed integer program and a satisficing hueristic scheduler. By making use of Tercio, a manufacturing facility or other high-intensity domain may fluidly command a team of robots to complete tasks in a quick, efficient manner while maintaining an ability to respond seamlessly to disturbances at execution. This greatly increases both productivity, by decreasing the time spent recompiling solutions, and responsiveness to humans in the area. These improvements in performance are displayed with multiple live demonstrations and simulations of teams of robots responding to disturbances. Tercio acts as an enabling step towards the ultimate goal of fully coordinated factories of dozens to hundreds of robots accomplishing many thousands of tasks in a safe, predictable, efficient manner.","abstract_has_math":false,"creators":["Wilcox, Ronald James"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Mechanical Engineering.","school":null,"contributors":[],"advisors":["Julie A. Shah and H. Harry Asada."],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013","date_published":"2013","updated_at":"2026-07-22T22:21:34Z","subjects":["Mechanical Engineering."],"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/81713","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Julie A. Shah and H. Harry Asada."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Mechanical Engineering."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Mechanical Engineering."]},{"key":"dc:creator","label":"Author","values":["Wilcox, Ronald James"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-10-24T17:47:26Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-10-24T17:47:26Z"]},{"key":"dc:date.issued","label":"Date","values":["2013"]},{"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":["Mechanical Engineering."]}]},{"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/81713"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2013.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 99-101)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Robots are increasingly entering domains typically thought of as human-only. This convergence of human and robotic agents leads to a need for new technology to enable safe and efficient collaboration. The goal of this thesis is to develop a task allocation and scheduling algorithm for teams of robots working with or around teams of humans in intense domains where tight, fluid choreography of robotic schedules is required to guarantee the safety of all involved while maintaining high levels of productivity. Three algorithms are presented in this work: the Adaptive Preferences Algorithm, the Multi-Agent Optimization Algorithm, and Tercio. Tercio, the culminatory algorithm, is capable of assigning robots to tasks and producing near-optimal schedules for ten agents and hundreds of tasks in seconds while making guarantees about process specifications such as worker safety and deadline satisfaction. This work extends dynamic scheduling methods to incorporate flexible windows with an optimization framework featuring a mixed integer program and a satisficing hueristic scheduler. By making use of Tercio, a manufacturing facility or other high-intensity domain may fluidly command a team of robots to complete tasks in a quick, efficient manner while maintaining an ability to respond seamlessly to disturbances at execution. This greatly increases both productivity, by decreasing the time spent recompiling solutions, and responsiveness to humans in the area. These improvements in performance are displayed with multiple live demonstrations and simulations of teams of robots responding to disturbances. Tercio acts as an enabling step towards the ultimate goal of fully coordinated factories of dozens to hundreds of robots accomplishing many thousands of tasks in a safe, predictable, efficient manner."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Flexible schedule optimization for human-robot collaboration"]}]}],"canonical_facts":{"dc:contributor.advisor":["Julie A. Shah and H. Harry Asada."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Mechanical Engineering."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Mechanical Engineering."],"dc:creator":["Wilcox, Ronald James"],"dc:date.accessioned":["2013-10-24T17:47:26Z"],"dc:date.available":["2013-10-24T17:47:26Z"],"dc:date.issued":["2013"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2013.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 99-101)."],"dc:description.abstract":["Robots are increasingly entering domains typically thought of as human-only. This convergence of human and robotic agents leads to a need for new technology to enable safe and efficient collaboration. The goal of this thesis is to develop a task allocation and scheduling algorithm for teams of robots working with or around teams of humans in intense domains where tight, fluid choreography of robotic schedules is required to guarantee the safety of all involved while maintaining high levels of productivity. Three algorithms are presented in this work: the Adaptive Preferences Algorithm, the Multi-Agent Optimization Algorithm, and Tercio. Tercio, the culminatory algorithm, is capable of assigning robots to tasks and producing near-optimal schedules for ten agents and hundreds of tasks in seconds while making guarantees about process specifications such as worker safety and deadline satisfaction. This work extends dynamic scheduling methods to incorporate flexible windows with an optimization framework featuring a mixed integer program and a satisficing hueristic scheduler. By making use of Tercio, a manufacturing facility or other high-intensity domain may fluidly command a team of robots to complete tasks in a quick, efficient manner while maintaining an ability to respond seamlessly to disturbances at execution. This greatly increases both productivity, by decreasing the time spent recompiling solutions, and responsiveness to humans in the area. These improvements in performance are displayed with multiple live demonstrations and simulations of teams of robots responding to disturbances. Tercio acts as an enabling step towards the ultimate goal of fully coordinated factories of dozens to hundreds of robots accomplishing many thousands of tasks in a safe, predictable, efficient manner."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/81713"],"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":["Mechanical Engineering."],"dc:title":["Flexible schedule optimization for human-robot collaboration"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:34Z"}