{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/30969"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/30969","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Arc Path Collision Avoidance Algorithm for Autonomous Ground Vehicles","abstract":"Presented in this thesis is a collision avoidance algorithm designed around an arc path model. The algorithm was designed for use on Virginia Tech robots entered in the 2003 and 2004 Intelligent Ground Vehicle Competition (IGVC) and on our 2004 entry into the DARPA Grand Challenge. The arc path model was used because of the simplicity of the calculations and because it can accurately represent the base kinematics for Ackerman or differentially steered vehicles. Clothoid curves have been used in the past to create smooth paths with continuously varying curvature, but clothoids are computationally intensive. The circular arc algorithm proposed here is designed with simplicity and versatility in mind. It is readily adaptable to ground vehicles of any size and shape. The algorithm is also designed to run with minimal tuning. The algorithm can be used as a stand alone reactive collision avoidance algorithm in simple scenarios, but it can be better optimized for speed and safety when guided by a global path planner. A complete navigation architecture is presented as an example of how obstacle avoidance can be incorporated in the algorithm.","abstract_html":"Presented in this thesis is a collision avoidance algorithm designed around an arc path model. The algorithm was designed for use on Virginia Tech robots entered in the 2003 and 2004 Intelligent Ground Vehicle Competition (IGVC) and on our 2004 entry into the DARPA Grand Challenge. The arc path model was used because of the simplicity of the calculations and because it can accurately represent the base kinematics for Ackerman or differentially steered vehicles. Clothoid curves have been used in the past to create smooth paths with continuously varying curvature, but clothoids are computationally intensive. The circular arc algorithm proposed here is designed with simplicity and versatility in mind. It is readily adaptable to ground vehicles of any size and shape. The algorithm is also designed to run with minimal tuning. The algorithm can be used as a stand alone reactive collision avoidance algorithm in simple scenarios, but it can be better optimized for speed and safety when guided by a global path planner. A complete navigation architecture is presented as an example of how obstacle avoidance can be incorporated in the algorithm.","abstract_has_math":false,"creators":["Naik, Ankur"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Mechanical Engineering","degree_department":"Mechanical Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":["Reinholtz, Charles F."],"committee_members":["Wicks, Alfred L.","Abbott, A. Lynn"],"year":2005,"date_issued":"2005-12-15","date_published":"2005-12-15","updated_at":"2026-07-22T22:19:42Z","subjects":["unmanned","collision avoidance","obstacle avoidance","autonomous","path planning"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-01162006-112326"],"render_values":[{"text":"etd-01162006-112326","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/30969","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Reinholtz, Charles F."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Wicks, Alfred L.","Abbott, A. Lynn"]},{"key":"dc:contributor.department","label":"Department","values":["Mechanical Engineering"]},{"key":"dc:creator","label":"Author","values":["Naik, Ankur"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T20:30:45Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T20:30:45Z","2006-01-20"]},{"key":"dc:date.issued","label":"Date","values":["2005-12-15"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mechanical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["unmanned","collision avoidance","obstacle avoidance","autonomous","path planning"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-01162006-112326"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/30969"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Presented in this thesis is a collision avoidance algorithm designed around an arc path model. The algorithm was designed for use on Virginia Tech robots entered in the 2003 and 2004 Intelligent Ground Vehicle Competition (IGVC) and on our 2004 entry into the DARPA Grand Challenge. The arc path model was used because of the simplicity of the calculations and because it can accurately represent the base kinematics for Ackerman or differentially steered vehicles. Clothoid curves have been used in the past to create smooth paths with continuously varying curvature, but clothoids are computationally intensive. The circular arc algorithm proposed here is designed with simplicity and versatility in mind. It is readily adaptable to ground vehicles of any size and shape. The algorithm is also designed to run with minimal tuning. The algorithm can be used as a stand alone reactive collision avoidance algorithm in simple scenarios, but it can be better optimized for speed and safety when guided by a global path planner. A complete navigation architecture is presented as an example of how obstacle avoidance can be incorporated in the algorithm."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:title","label":"Title","values":["Arc Path Collision Avoidance Algorithm for Autonomous Ground Vehicles"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Reinholtz, Charles F."],"dc:contributor.committeemember":["Wicks, Alfred L.","Abbott, A. Lynn"],"dc:contributor.department":["Mechanical Engineering"],"dc:creator":["Naik, Ankur"],"dc:date.accessioned":["2014-03-14T20:30:45Z"],"dc:date.available":["2014-03-14T20:30:45Z","2006-01-20"],"dc:date.issued":["2005-12-15"],"dc:description.abstract":["Presented in this thesis is a collision avoidance algorithm designed around an arc path model. The algorithm was designed for use on Virginia Tech robots entered in the 2003 and 2004 Intelligent Ground Vehicle Competition (IGVC) and on our 2004 entry into the DARPA Grand Challenge. The arc path model was used because of the simplicity of the calculations and because it can accurately represent the base kinematics for Ackerman or differentially steered vehicles. Clothoid curves have been used in the past to create smooth paths with continuously varying curvature, but clothoids are computationally intensive. The circular arc algorithm proposed here is designed with simplicity and versatility in mind. It is readily adaptable to ground vehicles of any size and shape. The algorithm is also designed to run with minimal tuning. The algorithm can be used as a stand alone reactive collision avoidance algorithm in simple scenarios, but it can be better optimized for speed and safety when guided by a global path planner. A complete navigation architecture is presented as an example of how obstacle avoidance can be incorporated in the algorithm."],"dc:description.degree":["Master of Science"],"dc:identifier.other":["etd-01162006-112326"],"dc:identifier.uri":["http://hdl.handle.net/10919/30969"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["unmanned","collision avoidance","obstacle avoidance","autonomous","path planning"],"dc:title":["Arc Path Collision Avoidance Algorithm for Autonomous Ground Vehicles"],"dc:type":["Thesis"],"thesis:degree_discipline":["Mechanical Engineering"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:42Z"}