English
Related papers

Related papers: Singularities of serial robots: Identification and…

200 papers

It was shown recently that parallel manipulators with several inverse kinematic solutions have the ability to avoid parallel singularities [Chablat 1998a] and self-collisions [Chablat 1998b] by choosing appropriate joint configurations for…

Robotics · Computer Science 2009-10-30 Damien Chablat , Philippe Wenger

A metamorphic robotic system is an aggregate of homogeneous robot units which can individually and selectively locomote in such a way as to change the global shape of the system. We introduce a mathematical framework for defining and…

Robotics · Computer Science 2007-05-23 A. Abrams , R. Ghrist

In this paper, we present the design and implementation of a robust motion formation distributed control algorithm for a team of mobile robots. The primary task for the team is to form a geometric shape, which can be freely translated and…

Robotics · Computer Science 2018-09-21 Hector Garcia de Marina , Johan Siemonsma , Bayu Jayawardhana , Ming Cao

Safe operation of systems such as robots requires them to plan and execute trajectories subject to safety constraints. When those systems are subject to uncertainties in their dynamics, it is challenging to ensure that the constraints are…

Robotics · Computer Science 2022-01-13 Gokhan Alcan , Ville Kyrki

Serially connected robots are promising candidates for performing tasks in confined spaces such as search-and-rescue in large-scale disasters. Such robots are typically limbless, and we hypothesize that the addition of limbs could improve…

Robots exhibit a rich variety of symmetries arising from their mechanical structure and the properties of their tasks. Although many robotics problems exhibit several symmetries simultaneously, existing approaches typically treat them in…

Robotics · Computer Science 2026-05-22 Loizos Hadjiloizou , Rodrigo Pérez-Dattari , Noémie Jaquier

In this paper we generalize the discrete r-homotopy to the discrete (s, r)-homotopy. Then by this notion, we introduce the discrete motion planning for robots which can move discreetly. Moreover, in this case the number of motion planning,…

Algebraic Topology · Mathematics 2024-08-13 Hadi Hassanzada , Hamid Torabi , Hanieh Mirebrahimi , Ameneh Babaee

Multi-robot systems are an efficient method to explore and map an unknown environment. The simulataneous localization and mapping (SLAM) algorithm is common for single robot systems, however multiple robots can share respective map data in…

Robotics · Computer Science 2021-02-03 Henry Fielding Cappel

Tendon-driven continuum robots (TDCRs), with their flexible backbones, offer the advantage of being used for navigating complex, cluttered environments. However, to do so, they typically require multiple segments, often leading to complex…

Robotics · Computer Science 2024-02-23 Priyanka Rao , Oren Salzman , Jessica Burgner-Kahrs

In the arbitrary pattern formation problem, $n$ autonomous, mobile robots must form an arbitrary pattern $P \subseteq \mathbb{R}^2$. The (deterministic) robots are typically assumed to be indistinguishable, disoriented, and unable to…

Robotics · Computer Science 2024-04-05 Christopher Hahn , Jonas Harbig , Peter Kling

We study the problem of determining optimal coordinated motions for two disc robots in an otherwise obstacle-free plane. Using the total path length traced by the two disc centres as a measure of distance, we give an exact characterization…

Computational Geometry · Computer Science 2017-01-23 David Kirkpatrick , Paul Liu

We consider the gathering problem for asynchronous and oblivious robots that cannot communicate explicitly with each other, but are endowed with visibility sensors that allow them to see the positions of the other robots. Most of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-15 Sayaka Kamei , Anissa Lamani , Fukuhito Ooshita , Sebastien Tixeuil , Koichi Wada

This chapter is about the fundamentals of fabrication, control, and human-robot interaction of a new type of collaborative robotic manipulators, called malleable robots, which are based on adjustable architectures of varying stiffness for…

Robotics · Computer Science 2025-02-07 Angus B. Clark , Xinran Wang , Alex Ranne , Nicolas Rojas

We present a comprehensive study on discrete morphological symmetries of dynamical systems, which are commonly observed in biological and artificial locomoting systems, such as legged, swimming, and flying animals/robots/virtual characters.…

Robotics · Computer Science 2023-07-27 Daniel Ordonez-Apraez , Mario Martin , Antonio Agudo , Francesc Moreno-Noguer

We introduce the use of hierarchical clustering for relaxed, deterministic coordination and control of multiple robots. Traditionally an unsupervised learning method, hierarchical clustering offers a formalism for identifying and…

Robotics · Computer Science 2015-07-08 Omur Arslan , Dan P. Guralnik , Daniel E. Koditschek

In this paper we investigate the computational power of a set of mobile robots with limited visibility. At each iteration, a robot takes a snapshot of its surroundings, uses the snapshot to compute a destination point, and it moves toward…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-08-07 Giuseppe A. Di Luna , Paola Flocchini , Nicola Santoro , Giovanni Viglietta

In this paper a new method for geometric robot calibration is introduced, which uses a calibration plate with precisely known distances between its measuring points. The relative measurement between two points on the calibration plate is…

Robotics · Computer Science 2025-10-30 Bernhard Rameder , Hubert Gattringer , Andreas Mueller

This paper presents a deterministic algorithm for forming a given asymmetric pattern in finite time by a set of autonomous, homogeneous, oblivious mobile robots under the CORDA model. The robots are represented as points on the 2D plane.…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-03-12 Sruti Gan Chaudhuri , Swapnil Ghike , Shrainik Jain , Krishnendu Mukhopadhyaya

The exploration problem in the discrete universe, using identical oblivious asynchronous robots without direct communication, has been well investigated. These robots have sensors that allow them to see their environment and move…

Multiagent Systems · Computer Science 2012-05-23 Ajoy K. Datta , Anissa Lamani , Lawrence L. Larmore , Franck Petit

This paper proposes a strategy for a group of deaf and dumb robots, carrying clocks from different countries, to meet at a geographical location which is not fixed in advanced. The robots act independently. They can observe others, compute…

Robotics · Computer Science 2016-04-05 Subhash Bhagat , Sruti Gan Chaudhuri , Krishnendu Mukhopadhyaya