K. Madhava Krishna

Perception and remembrance of the environment during real-time navigation of a mobile robot

Abstract This paper deals with the advantages of incorporating cognition and remembrance capabilities in a sensor-based real-time navigation algorithm. The specific features of the algorithm apart from real-time collision avoidance include spatial comprehension of the local scenario of the robot, remembrance and recollection of such comprehended scenarios and temporal correlation of similar scenarios witnessed during different instants of navigation. These features enhance the robot’s performance by providing for a memory-based reasoning whereby the robot’s forthcoming decisions are also affected by its previous experiences during the navigation apart from the current range inputs. The environment of the robot is modeled by classifying temporal sequences of spatial sensory patterns. A fuzzy classification scheme coupled to Kohonen’s self-organizing map and fuzzy ART network determines this classification. A detailed comparison of the present method with other recent approaches in the specific case of local minimum detection and avoidance is also presented. As for escaping the local minimum barrier is concerned this paper divulges a new system of rules that lead to shorter paths than the other methods. The method has been tested in concave, maze-like, unstructured and altered environments and its efficacy established.

Safe proactive plans and their execution

We present in this paper a methodology for computing the maximum velocity profile over a trajectory planned for a mobile robot. Environment and robot dynamics as well as the constraints of the robot sensors determine the profile. The planned profile is indicative of maximum speeds that can be possessed by the robot along its path without colliding with any of the mobile objects that could intercept its future trajectory. The mobile objects could be arbitrary in number and the only information available regarding them is their maximum possible velocity. The velocity profile also enables one to deform planned trajectories for better trajectory time. The methodology has been adopted for holonomic and nonholonomic motion planners. An extension of the approach to an online real-time scheme that modifies and adapts the path as well as velocities to changes in the environment such that both safety and execution time are not compromised is also presented for the holonomic case. Simulation and experimental results demonstrate the efficacy of this methodology. c 2005 Elsevier B.V. All rights reserved.

Realtime multibody visual SLAM with a smoothly moving monocular camera

This paper presents a realtime, incremental multibody visual SLAM system that allows choosing between full 3D reconstruction or simply tracking of the moving objects. Motion reconstruction of dynamic points or objects from a monocular camera is considered very hard due to well known problems of observability. We attempt to solve the problem with a Bearing only Tracking (BOT) and by integrating multiple cues to avoid observability issues. The BOT is accomplished through a particle filter, and by integrating multiple cues from the reconstruction pipeline. With the help of these cues, many real world scenarios which are considered unobservable with a monocular camera is solved to reasonable accuracy. This enables building of a unified dynamic 3D map of scenes involving multiple moving objects. Tracking and reconstruction is preceded by motion segmentation and detection which makes use of efficient geometric constraints to avoid difficult degenerate motions, where objects move in the epipolar plane. Results reported on multiple challenging real world image sequences verify the efficacy of the proposed framework.

Detection, Tracking and Avoidance of Multiple Dynamic Objects

Real-time motion planning in an unknown environment involves collision avoidance of static as well as moving agents. Strategies suitable for navigation in a stationary environment cannot be translated as strategies per se for dynamic environments. In a purely stationary environment all that the sensor can detect can only be a static object is assumed implicitly. In a mixed environment such an assumption is no longer valid. For efficient collision avoidance identification of the attribute of the detected object as static or dynamic is probably inevitable. Presented here are two novel schemes for perceiving the presence of dynamic objects in the robots neighborhood. One of them, called the Model-Based Approach (MBA) detects motion by observing changes in the features of the environment represented on a map. The other CBA (cluster-based approach) partitions the contents of the environment into clusters representative of the objects. Inspecting the characteristics of the partitioned clusters reveals the presence of dynamic agents. The extracted dynamic objects are tracked in consequent samples of the environment through a straightforward nearest neighbor rule based on the Euclidean metric. A distributed fuzzy controller avoids the tracked dynamic objects through direction and velocity control of the mobile robot. The collision avoidance scheme is extended to overcome multiple dynamic objects through a priority based averaging technique (PBA). Indicating the need for additional rules apart from the PBA to overcome conflicting decisions while tackling multiple dynamic objects can be considered as another contribution of this effort. The method has been tested through simulations by navigating a sensor-based mobile robot amidst multiple dynamic objects and its efficacy established.

On the influence of sensor capacities and environment dynamics onto collision-free motion plans

A methodology for computing the maximum velocity profile for a planned trajectory of the robot is described in this paper. The profile is computed considering the robot and environment dynamics as well as the constraints of the sensing apparatus. The mobile objects can be arbitrary in number and their direction and velocity of motion is not known. The only known information about the moving objects is the maximum velocity they can possess. The robot that moves with the computed velocity profile can assure from its side that it would not collide onto any of the numerous moving objects that could intercept its future trajectory. The methodology has been incorporated onto a motion planner for a nonholonomous robot and the results presented. The motivation here is to facilitate the process of having safe and understanding robots. Hence the planned velocity profiles are in general conservative though the robot could perhaps do better on-line. However at planning time the robots immobility before collision is guaranteed.

Moving object detection by multi-view geometric techniques from a single camera mounted robot

The ability to detect, and track multiple moving objects like person and other robots, is an important prerequisite for mobile robots working in dynamic indoor environments. We approach this problem by detecting independently moving objects in image sequence from a monocular camera mounted on a robot. We use multi-view geometric constraints to classify a pixel as moving or static. The first constraint, we use, is the epipolar constraint which requires images of static points to lie on the corresponding epipolar lines in subsequent images. In the second constraint, we use the knowledge of the robot motion to estimate a bound in the position of image pixel along the epipolar line. This is capable of detecting moving objects followed by a moving camera in the same direction, a so-called degenerate configuration where the epipolar constraint fails. To classify the moving pixels robustly, a Bayesian framework is used to assign a probability that the pixel is stationary or dynamic based on the above geometric properties and the probabilities are updated when the pixels are tracked in subsequent images. The same framework also accounts for the error in estimation of camera motion. Successful and repeatable detection and pursuit of people and other moving objects in realtime with a monocular camera mounted on the Pioneer 3DX, in a cluttered environment confirms the efficacy of the method.

Motion segmentation of multiple objects from a freely moving monocular camera

Motion segmentation is an inevitable component for mobile robotic systems such as the case with robots performing SLAM and collision avoidance in dynamic worlds. This paper proposes an incremental motion segmentation system that efficiently segments multiple moving objects and simultaneously build the map of the environment using visual SLAM modules. Multiple cues based on optical flow and two view geometry are integrated to achieve this segmentation. A dense optical flow algorithm is used for dense tracking of features. Motion potentials based on geometry are computed for each of these dense tracks. These geometric potentials along with the optical flow potentials are used to form a graph like structure. A graph based segmentation algorithm then clusters together nodes of similar potentials to form the eventual motion segments. Experimental results of high quality segmentation on different publicly available datasets demonstrate the effectiveness of our method.

A visual exploration algorithm using semantic cues that constructs image based hybrid maps

A vision based exploration algorithm that invokes semantic cues for constructing a hybrid map of images - a combination of semantic and topological maps is presented in this paper. At the top level the map is a graph of semantic constructs. Each node in the graph is a semantic construct or label such as a room or a corridor, the edge represented by a transition region such as a doorway that links the two semantic constructs. Each semantic node embeds within it a topological graph that constitutes the map at the middle level. The topological graph is a set of nodes, each node representing an image of the higher semantic construct. At the low level the topological graph embeds metric values and relations, where each node embeds the pose of the robot from which the image was taken and any two nodes in the graph are related by a transformation consisting of a rotation and translation. The exploration algorithm explores a semantic construct completely before moving or branching onto a new construct. Within each semantic construct it uses a local feature based exploration algorithm that uses a combination of local and global decisions to decide the next best place to move. During the process of exploring a semantic construct it identifies transition regions that serve as gateways to move from that construct to another. The exploration is deemed complete when all transition regions are marked visited. Loop detection happens at transition regions and graph relaxation techniques are used to close loops when detected to obtain a consistent metric embedding of the robot poses. Semantic constructs are labeled using a visual bag of words(VBOW) representation with a probabilistic SVM classifier.

Heterogeneous UGV-MAV exploration using integer programming

This paper presents a novel exploration strategy for coordinated exploration between unmanned ground vehicles (UGV) and micro-air vehicles (MAV). The exploration is modeled as an Integer Programming (IP) optimization problem and the allocation of the vehicles(agents) to frontier locations is modeled using binary variables. The formulation is also studied for distributed system, where agents are divided into multiple teams using graph partitioning. Optimization seamlessly integrates several practical constraints that arise in exploration between such heterogeneous agents and provides an elegant solution for assigning task to agents. We have also presented comparison with previous methods based on distance traversed and computational time to signify advantages of presented method. We also show practical realization of such an exploration where an UGV-MAV team efficiently builds a map of an indoor environment.

A two phase recursive tree propagation based multi-robotic exploration framework with fixed base station constraint

A multi-robotic exploration with the requirement of communication link to a fixed base station is presented in this paper. The robots organize themselves into roles of maintainers of communication (hinged robots or robot nodes) or explorers of the environment ensuring that every robot is in contact with the base station directly or through the hinged robots. A two phased strategy for the same is presented. The first phase is characterized by a recursive growth of trees that starts from the root node or the base station and then repeated from other nodes of the hitherto grown tree in a depth first fashion. The second phase constitutes the recursive tree growth invoked repeatedly from the frontier nodes. While the first phase rapidly explores areas around the base station in a concentric fashion, the second phase extends the depth of the explored area to increase the limits of coverage. The strategy is consistent in that none of the robots loose contact with the base station. Extensive simulations confirm the efficacy of the method and comparisons portray performance gain in terms of exploration time and absence of deadlocks vis-a-vis the few methods previously reported in the literature.