PhD Dissertation Defense by Daniel Pickem

Event Details
  • Date/Time:
    • Monday March 28, 2016
      10:00 am - 12:00 pm
  • Location: TSRB 530
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Self-Reconfigurable Multi-Robot Systems

Full Summary: No summary paragraph submitted.

Committee:

Dr. Martha A. Grover, School of Chemical and Biomolecular Engineering, Georgia Tech Dr. Justin Romberg, School of Electrical and Computer Engineering, Georgia Tech Dr. Jun Ueda, School of Mechanical Engineering, Georgia Tech Dr. Jeff S. Shamma, School of Electrical and Computer Engineering, Georgia Tech Dr. Magnus Egerstedt, School of Electrical and Computer Engineering, Georgia Tech

 

Abstract:

Self-reconfigurable robotic systems are variable-morphology machines capable of changing their overall structure by rearranging the modules they are composed of. Individual modules are capable of connecting and disconnecting to and from one another, which allows the robot to adapt to changing environments. Optimally reconfiguring such systems is computationally prohibitive and thus in general self-reconfiguration approaches aim at approximating optimal solutions. Nonetheless, even for approximate solutions, centralized methods scale poorly in the number of modules. Therefore, the objective of this research is the development of decentralized self-reconfiguration methods for modular robotic systems.

 

Building on completeness results of the centralized algorithms in this work, decentralized methods are developed that guarantee convergence to a given target shape. A game-theoretic approach lays the theoretical foundation of a novel potential game-based formulation of the self-reconfiguration problem. Stochastic convergence guarantees are provided for a large class of utility functions used by purely self-interested agents. Furthermore, two extensions to the basic game-theoretic learning algorithm are proposed that enable agents to modify the algorithms' parameters during runtime and improve convergence times. The flexibility in the choice of utility functions together with runtime adaptability makes the presented approach and the underlying theory suitable for a range of problems that rely on decentralized local control to guarantee global, emerging properties.

 

The experimental evaluation of the presented algorithms relies on a newly developed multi-robotic testbed called the "Robotarium" that is equipped with novel custom-designed miniature robots, the "GRITSBots". The Robotarium provides hardware validation of self-reconfiguration on robots but more importantly introduces a novel paradigm for remote accessibility of multi-agent testbeds with the goal of lowering the barrier to entrance into the field of multi-robot research and education.

Additional Information

In Campus Calendar
No
Groups

Graduate Studies

Invited Audience
Public
Categories
Other/Miscellaneous
Keywords
PhD Dissertation Defense
Status
  • Created By: Jacquelyn Strickland
  • Workflow Status: Published
  • Created On: Mar 8, 2016 - 11:01am
  • Last Updated: Oct 7, 2016 - 10:16pm