Cristian Mahulea

Path Planning of Cooperative Mobile Robots Using Discrete Event Models


Скачать книгу

Offboard communication was provided via two radio channels: one for video and the other providing command and control. This ability to make maps and reason about them made Shakey capable of performing more complex tasks than former robots based on reactive navigation strategies. After Shakey, the next big step in the field of mobile robotics came from the Robotics Institute at Carnegie Mellon University in the 1980s [28]. The Terregator robot (Terrestrial Navigator) was designed to operate autonomously in outdoor scenarios, see Figure 1.2b. It was a six‐wheeled skid‐steer robot utilizing compliant tires for suspension. Terregator subsystems included locomotion, power, computation, controls, wireless telemetry (serial links and two channels of UHF video), orientation sensors, and navigation payloads. The robot's onboard control system consisted of a central processing unit (CPU) linked to motor controllers. This CPU calculated the robot's position and orientation from a gyroscope, wheel encoders, and inclinometers (dead‐reckoning). Additionally, this system was also responsible for guiding the robot to a commanded destination provided by an offboard supervisor (remote command station). This supervisor made use of the images coming from the video camera mounted on the vehicle. Terregator was even used for mapping a portion of a mine thanks to its path planning and mapping capabilities [28]. Another big milestone in the early ages of mobile robotics came from the University of Munich in Germany. Several vehicles developed by Prof. Ernst Dickmanns, e.g. Daimler‐Benz VITA‐2 and UniBwM VaMP, drove autonomously on European highways at speeds up to 130 km/h, see Figure 1.2c. This astonishing leap was achieved by using a visual feedback control system that tracked the road boundaries. This advanced control system ran in a multiprocessor image processing system using contour correlation and curvature models together with the laws of perspective projection [52]. The vehicle's position was estimated relative to the driving lane and road curvature by means of a Kalman filter. In 1994, the VaMP driverless car designed by Prof. Dickmanns drove 1600 kilometers, of which 95% were driven autonomously [51].

      These pioneering mobile robots opened the door to the significant achievements in the field of mobile robotics during the last twenty years. Today, mobile robots have explored other worlds such as Mars or the Moon, e.g. MER rovers and MSL rover [87, 194; mobile robots have worked at Antarctica seeking meteorites, e.g. Nomad robot [5; robots are able to clean our houses, e.g. iRobot Roomba; to perform harvesting activities in agriculture, e.g. ASI autonomous tractor; and they are also present in our schools, like the SoftBank Robotics NAO humanoid robot.

      A fundamental task for any mobile robot is its ability to plan collision‐free trajectories from a start to a goal position or visiting a series of positions, i.e. regions of interest, among a collection of (static) obstacles. This is the robot's cognitive level. Cognition generally represents the purposeful decision‐making and execution that a system utilizes to achieve its highest‐order goals. Given a map and a goal position (or a list of high‐level goals), path planning involves identifying a trajectory that will cause the robot to reach the goal position (a 2D point) or pose (a 2D point and an orientation) when executed [35, 135, 191]. It bears mentioning that position refers to the longitudinal and lateral coordinates in a Cartesian frame. Pose also considers the orientation.

c01f003

      The first category, exact algorithms, can be divided into two areas: road map planning and cell decomposition. The road map planning approaches capture the connectivity of the robot's free space in a network of 2D curves or lines, called road maps. Once a road map is constructed, it is used as a network of road segments. At this point, path planning is reduced to connecting the initial and goal position of the robot to the road network and then searching for a series of roads from the initial robot position to its goal position [191]. To this category