Find results with:

Add another field

Search by date

to

Searching collections:

Dartmouth Dissertations

Add or remove collections

Home Dartmouth Dissertations kotay2003 1

Reference URL

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

Self-reconfiguring robots: designs, algorithms, and applications.

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Back to top

Powered by CONTENTdm®

Call No.	Ph.D. 2003
Author	Kotay, Keith
Title	Self-reconfiguring robots: designs, algorithms, and applications.
Date	2003
Abstract	Self-reconfiguring robots are robots composed of many physically connected modules which can change their structural configuration to support multiple functionalities. We claim that self-reconfiguring robots are more versatile, extensible, and fault tolerant than conventional fixed-architecture robots. In this thesis we discuss the scientific challenges of self-reconfiguring robots and their applications. We describe the design of our Molecule self-reconfiguring module and give results for our Molecule experiments. We also present planning algorithms tightly coupled to the Molecule hardware, as well as a generic approach for developing provably correct, distributed control algorithms which can be instantiated onto various hardware platforms. The Molecule is a robotic module capable of aggregating with identical modules to form dynamic three-dimensional structures. Several prototype designs are described. A planner is presented for developing relocation plans and an algorithm is described for merging multiple serial plans into a parallel plan. Control algorithms are proposed for Molecule structure locomotion, including planar translation, vertical stacking, and stair climbing. Experimental results are given for Molecule structure self-reconfiguration and for planning. design and analysis, permitting the development of performance guarantees. Algorithms consist of geometric rules based on the local environment and module internal state. We demonstrate provably correct locomotion algorithms, both with and without obstacles. We also present reconfiguration algorithms for self-assembly and an adaptive structure. Automated proving techniques are proposed which can verify rule set correctness. We describe several instantiations of our algorithms onto different hardware platforms, demonstrating that the benefits of our algorithmic performance guarantees can be applied to multiple hardware implementations.
Description	1 online resource (xiii, 356 leaves) : illustrations (some color)
Format	application/pdf
Advisor	Rus, Daniela
Subject	Robots -- Control systems. ; Robots -- Motion. ; Computer algorithms. ; Electronic data processing -- Distributed processing.
College	Dartmouth College -- Department of Computer Science.
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D)--Dartmouth College.
Copyright	In Copyright. This material is protected by copyright and/or related rights. You are free to use this material in any way that is permitted by copyright law that applies to your use. For other uses, you need to obtain permission from the rights-holder(s). http://rightsstatements.org/page/InC/1.0/
DOI	https://doi.org/10.1349/ddlp.3195

Title	kotay2003 1
Full Text	SELF-RECONFIGURING ROBOTS: DESIGNS, ALGORITHMS, AND APPLICATIONS A Thesis Submitted to the Faculty in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science by Keith Kotay DARTMOUTH COLLEGE Hanover, New Hampshire December 15, 2003

Find results with:

Searching collections:

Home Dartmouth Dissertations kotay2003 1

Self-reconfiguring robots: designs, algorithms, and applications.

Object Description

Description

Self-reconfiguring robots: designs, algorithms, and...

Self-reconfiguring robots: designs, algorithms, and...

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12