Perception-Driven Obstacle-Aided Locomotion for Snake Robots: The State of the Art, Challenges and Possibilities †
Filippo Sanfilippo, Jon Azpiazu, Giancarlo Marafioti and 3 more
Applied Sciences · 2017
doi:10.3390/app7040336 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In nature, snakes can gracefully traverse a wide range of different and complex environments. Snake robots that can mimic this behaviour could be fitted with sensors and transport tools to hazardous or confined areas that other robots and humans are unable to access. In order to carry out such tasks, snake robots must have a high degree of awareness of their surroundings (i.e., perception-driven locomotion) and be capable of efficient obstacle exploitation (i.e., obstacle-aided locomotion) to gain propulsion. These aspects are pivotal in order to realise the large variety of possible snake robot applications in real-life operations such as fire-fighting, industrial inspection, search-and-rescue, and more. In this paper, we survey and discuss the state of the art, challenges, and possibilities of perception-driven obstacle-aided locomotion for snake robots. To this end, different levels of autonomy are identified for snake robots and categorised into environmental complexity, mission complexity, and external system independence. From this perspective, we present a step-wise approach on how to increment snake robot abilities within guidance, navigation, and control in order to target the different levels of autonomy. Pertinent to snake robots, we focus on current strategies for snake robot locomotion in the presence of obstacles. Moreover, we put obstacle-aided locomotion into the context of perception and mapping. Finally, we present an overview of relevant key technologies and methods within environment perception, mapping, and representation that constitute important aspects of perception-driven obstacle-aided locomotion.
Abstract licence: CC BY
References92
- 34.
39 more references, whose wording the paper’s licence keeps private.
All 92 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.