Planning stable and efficient paths for articulated mobile robots on challenging terrains

An analytical strategy to generate stable paths for a reconfigurable vehicle while also meeting additional navigational objectives is herein proposed. The work is motivated by robots traversing over challenging terrains during search and rescue operations, such as those equipped with manipulator arms and/or flippers. The proposed solution looks at minimizing the length of the traversed path and the energy expenditure in changing postures, yet also accounts for additional constraints in terms of sensor visibility (i.e arm configurations close to those orthogonal to the horizontal global plane which can afford a wider sensor view) and traction (i.e. flipper angles that provide the largest trackterrain interaction area). The validity of the proposed planning approach is evaluated with a multitracked robot fitted with flippers and a range camera at the end of a manipulator arm while navigating over two challenging 3D terrain data sets: one in a mock-up urban search and rescue arena (USAR), and a second one from a publicly available quasi-outdoor rover testing facility (UTIAS)

An evolutionary algorithm for online, resource constrained, multi-vehicle sensing mission planning

Mobile robotic platforms are an indispensable tool for various scientific and industrial applications. Robots are used to undertake missions whose execution is constrained by various factors, such as the allocated time or their remaining energy. Existing solutions for resource constrained multi-robot sensing mission planning provide optimal plans at a prohibitive computational complexity for online application [1],[2],[3]. A heuristic approach exists for an online, resource constrained sensing mission planning for a single vehicle [4]. This work proposes a Genetic Algorithm (GA) based heuristic for the Correlated Team Orienteering Problem (CTOP) that is used for planning sensing and monitoring missions for robotic teams that operate under resource constraints. The heuristic is compared against optimal Mixed Integer Quadratic Programming (MIQP) solutions. Results show that the quality of the heuristic solution is at the worst case equal to the 5% optimal solution. The heuristic solution proves to be at least 300 times more time efficient in the worst tested case. The GA heuristic execution required in the worst case less than a second making it suitable for online execution.Comment: 8 pages, 5 figures, accepted for publication in Robotics and Automation Letters (RA-L

Stable path planning for reconfigurable robots over uneven terrains

University of Technology Sydney. Faculty of Engineering and Information Technology.Autonomous mobile robots are required to find safe and feasible routes in the environment when operating over challenging terrains. The most influential tip-over stability measures are based on two criteria; the robot’s centre of mass (CM) and the support polygon defined by the convex area spanned between the ground contact points. The force angle (FA) stability margin is employed in this work given its widespread use and simple geometric interpretation. A method to compute the contact points between a tracked robot and rugged terrain and predict robot’s stability axes on 3D meshed maps reconstructed from 3D point clouds using the open dynamics engine (ODE) is presented. The validity and the need for stability computations based on the proposed contact points prediction algorithm is established through experiments over two common indoor obstacles i.e. ramps and stairs. An analytical strategy to generate stable paths for reconfigurable robots whilst also meeting additional navigational objectives is hereby proposed. The suggested solution looks at minimizing the length of the traversed path and the energy expenditure in changing postures, and also accounts for additional constraints in terms of sensor visibility and traction. A statistical analysis of stability prediction to account for the uncertainties associated with the actual robot’s dynamic model, its localisation in the ground, and the terrain models is introduced. Probability density function (PDF) of contact points, CM and the FA stability measure are numerically estimated, with simulation results performed on the ODE simulator based on uncertain parameters. Two techniques are presented: a conventional standard Monte Carlo (SMC) scheme, and a structured unscented transform (UT) which results in significant improvement in computational efficiency. A novel probabilistic stability criterion derived from the cumulative distribution of the FA margin is introduced that allows a safety constraint to be dynamically updated by available sensor data as it becomes available. The advantages of planning with probabilistic stability is demonstrated using a grid based A* algorithm as well as a sampling based RRT planner. The validity of the proposed approach is evaluated with a multi-tracked robot fitted with a manipulator arm and a range camera using two challenging 3D terrains data sets: one obtained whilst operating the robot in a mock-up urban search and rescue arena, and a second one from a publicly available on-line data from a quasi-outdoor rover testing facility

Automatic fine motor control behaviours for autonomous mobile agents operating on uneven terrains

A novel mechanism able to produce increasingly stable paths for mobile robotic agents travelling over uneven terrain is proposed in this paper. In doing so, cognitive agents can focus on higher-level goal planning, with the increased confidence the resulting tasks will be automatically accomplished via safe and reliable paths within the lower-level skills of the platform. The strategy proposes the extension of the Fast Marching level-set method of propagating interfaces in 3D lattices with a metric to reduce robot body instability. This is particularly relevant for kinematically reconfigurable platforms which significantly modify their mass distribution through posture adaptation, such as humanoids or mobile robots equipped with manipulator arms or varying traction arrangements. Simulation results of an existing reconfigurable mobile rescue robot operating on real scenarios illustrate the validity of the proposed strategy. Copyright 2010 ACM

A kyno-dynamic metric to plan stable paths over uneven terrain

A generic methodology to plan increasingly stable paths for mobile platforms travelling over uneven terrain is proposed in this paper. This is accomplished by extending the Fast Marching level-set method of propagating interfaces in 3D lattices with an analytical kyno-dynamic metric which embodies robot stability in the given terrain. This is particularly relevant for reconfigurable platforms which significantly modify their mass distribution through posture adaptation, such as robots equipped with manipulator arms or varying traction arrangements. Results obtained from applying the proposed strategy in a mobile rescue robot operating on simulated and real terrain data illustrate the validity of the proposed strategy. ©2010 IEEE

Adoption of vehicular ad hoc networking protocols by networked robots

This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several advantages over their single-robot counterparts. Typically, this integration of wireless communication is tackled in a quite pragmatic manner, only a few authors presented novel Robotic Ad Hoc Network (RANET) protocols that were designed specifically with robotic use cases in mind. This is in sharp contrast with the domain of vehicular ad hoc networks (VANET). This observation is the starting point of this paper. If the results of previous efforts focusing on VANET protocols could be reused in the RANET domain, this could lead to rapid progress in the field of networked robots. To investigate this possibility, this paper provides a thorough overview of the related work in the domain of robotic and vehicular ad hoc networks. Based on this information, an exhaustive list of requirements is defined for both types. It is concluded that the most significant difference lies in the fact that VANET protocols are oriented towards low throughput messaging, while RANET protocols have to support high throughput media streaming as well. Although not always with equal importance, all other defined requirements are valid for both protocols. This leads to the conclusion that cross-fertilization between them is an appealing approach for future RANET research. To support such developments, this paper concludes with the definition of an appropriate working plan