{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/16796"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/16796","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Rendezvous of multiple Dubins car agents with minimal sensing and control requirements","abstract":"We study minimalism in sensing and control by considering a multi-agent system in which each agent moves like a Dubins car and has a limited sensor that reports only the presence of another agent within some sector of its windshield. Using a very simple quantized control law with three values, each agent tracks another agent assigned to it by maintaining that agent within this windshield sector. We use Lyapunov analysis to show that by acting autonomously in this way, the agents will achieve rendezvous given a connected initial assignment graph and a merge assumption. We then proceed to show that, with a slightly different control law, an initial assignment is not required and the sensing model can be weakened further. A distinguishing feature of our approach is that it does not involve any estimation procedure aimed at reconstructing coordinate information. Our scenario thus appears to be the first example in which an interesting task is performed with extremely coarse sensing and control, and without state estimation. The system was implemented in computer simulation, accessible through the Web, of which the results are presented in the thesis.","abstract_html":"We study minimalism in sensing and control by considering a multi-agent system in which each agent moves like a Dubins car and has a limited sensor that reports only the presence of another agent within some sector of its windshield. Using a very simple quantized control law with three values, each agent tracks another agent assigned to it by maintaining that agent within this windshield sector. We use Lyapunov analysis to show that by acting autonomously in this way, the agents will achieve rendezvous given a connected initial assignment graph and a merge assumption. We then proceed to show that, with a slightly different control law, an initial assignment is not required and the sensing model can be weakened further. A distinguishing feature of our approach is that it does not involve any estimation procedure aimed at reconstructing coordinate information. Our scenario thus appears to be the first example in which an interesting task is performed with extremely coarse sensing and control, and without state estimation. The system was implemented in computer simulation, accessible through the Web, of which the results are presented in the thesis.","abstract_has_math":false,"creators":["Yu, Jingjin"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["LaValle, Steven M."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-08-20T17:58:03Z","date_published":"2010-08-20T17:58:03Z","updated_at":"2026-07-22T22:25:09Z","subjects":["rendezvous","multi-agent systems","formation control","Lyapunov analysis"],"languages":["en"],"rights":["Copyright 2010 Jingjin Yu"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/16796","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["LaValle, Steven M."]},{"key":"dc:creator","label":"Author","values":["Yu, Jingjin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-08-20T17:58:03Z","2010-08"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["rendezvous","multi-agent systems","formation control","Lyapunov analysis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Jingjin Yu"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/16796"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We study minimalism in sensing and control by considering a multi-agent system in which each agent moves like a Dubins car and has a limited sensor that reports only the presence of another agent within some sector of its windshield. Using a very simple quantized control law with three values, each agent tracks another agent assigned to it by maintaining that agent within this windshield sector. We use Lyapunov analysis to show that by acting autonomously in this way, the agents will achieve rendezvous given a connected initial assignment graph and a merge assumption. We then proceed to show that, with a slightly different control law, an initial assignment is not required and the sensing model can be weakened further. A distinguishing feature of our approach is that it does not involve any estimation procedure aimed at reconstructing coordinate information. Our scenario thus appears to be the first example in which an interesting task is performed with extremely coarse sensing and control, and without state estimation. The system was implemented in computer simulation, accessible through the Web, of which the results are presented in the thesis.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-06-03T21:32:13Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 jingjinyu-ms-thesis.pdf: 813348 bytes, checksum: d5872d68b0c6c5215030c8758d4a8edb (MD5)","Made available in DSpace on 2010-08-20T17:58:03Z (GMT). No. of bitstreams: 3 jingjinyu-ms-thesis.pdf: 813348 bytes, checksum: d5872d68b0c6c5215030c8758d4a8edb (MD5) Yu_Jingjin.pdf: 812749 bytes, checksum: 08cc5d81084dde77d43069ffcf780b8f (MD5) license.txt: 4057 bytes, checksum: 8a0f0c901cd378040dc93c89c8edc569 (MD5)"]},{"key":"dc:title","label":"Title","values":["Rendezvous of multiple Dubins car agents with minimal sensing and control requirements"]}]}],"canonical_facts":{"dc:contributor":["LaValle, Steven M."],"dc:creator":["Yu, Jingjin"],"dc:date":["2010-08-20T17:58:03Z","2010-08"],"dc:description":["We study minimalism in sensing and control by considering a multi-agent system in which each agent moves like a Dubins car and has a limited sensor that reports only the presence of another agent within some sector of its windshield. Using a very simple quantized control law with three values, each agent tracks another agent assigned to it by maintaining that agent within this windshield sector. We use Lyapunov analysis to show that by acting autonomously in this way, the agents will achieve rendezvous given a connected initial assignment graph and a merge assumption. We then proceed to show that, with a slightly different control law, an initial assignment is not required and the sensing model can be weakened further. A distinguishing feature of our approach is that it does not involve any estimation procedure aimed at reconstructing coordinate information. Our scenario thus appears to be the first example in which an interesting task is performed with extremely coarse sensing and control, and without state estimation. The system was implemented in computer simulation, accessible through the Web, of which the results are presented in the thesis.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-06-03T21:32:13Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 jingjinyu-ms-thesis.pdf: 813348 bytes, checksum: d5872d68b0c6c5215030c8758d4a8edb (MD5)","Made available in DSpace on 2010-08-20T17:58:03Z (GMT). No. of bitstreams: 3 jingjinyu-ms-thesis.pdf: 813348 bytes, checksum: d5872d68b0c6c5215030c8758d4a8edb (MD5) Yu_Jingjin.pdf: 812749 bytes, checksum: 08cc5d81084dde77d43069ffcf780b8f (MD5) license.txt: 4057 bytes, checksum: 8a0f0c901cd378040dc93c89c8edc569 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/16796"],"dc:language":["en"],"dc:rights":["Copyright 2010 Jingjin Yu"],"dc:subject":["rendezvous","multi-agent systems","formation control","Lyapunov analysis"],"dc:title":["Rendezvous of multiple Dubins car agents with minimal sensing and control requirements"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:09Z"}