About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

Self-reconfiguration of modular underwater robots using an energy heuristic

From

Dept. of Electr. Eng., Autom. & Control Group, Tech. Univ. of Denmark, Lyngby, Denmark1

This paper investigates self-reconfiguration of a modular robotic system, which consists of a cluster of modular vehicles that can attach to each other by a connection mechanism. Thereby, they can form a desired morphology to meet task specific requirements. Reconfiguration can be needed due to limitations from dimensions of passable corridors for an underwater maintenance task, for supplemental instrumentation that is available on a particular robot, or as remedial action if one robot in a cluster suffers from malfunction.

Being crucial for autonomous underwater vehicles, energy consumed is employed as a heuristic. The paper shows how the Basic Theta* algorithm can be guided by an energy criterion to calculate a transition from start- to goal morphology. Individual robots are guided while minimizing the overall energy for propulsion and for balancing restoring forces and moments in morphologies.

The properties of the proposed self-reconfiguration algorithm are evaluated through simulations and preliminary model tank experiments. The energy based heuristic for reconfiguration is compared to a traditional solution that minimizes the Euclidean distance.

Language: English
Publisher: IEEE
Year: 2017
Pages: 6277-6284
Proceedings: 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
ISBN: 1538626810 , 1538626829 , 1538626837 , 9781538626818 , 9781538626825 and 9781538626832
ISSN: 21530866 and 21530858
Types: Conference paper
DOI: 10.1109/IROS.2017.8206530

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis