Obstacle avoidance in a dynamic environment: a collision coneapproach

A novel collision cone approach is proposed as an aid to collision detection and avoidance between irregularly shaped moving objects with unknown trajectories. It is shown that the collision cone can be effectively used to determine whether collision between a robot and an obstacle (both moving in a dynamic environment) is imminent. No restrictions are placed on the shapes of either the robot or the obstacle, i.e., they can both be of any arbitrary shape. The collision cone concept is developed in a phased manner starting from existing analytical results that enable prediction of collision between two moving point objects. These results are extended to predict collision between a point and a circular object, between a point and an irregularly shaped object, between two circular objects, and finally between two irregularly shaped objects. Using the collision cone approach, several strategies that the robot can follow in order to avoid collision, are presented. A discussion on how the shapes of the robot and obstacles can be approximated in order to reduce computational burden is also presented. A number of examples are given to illustrate both collision prediction and avoidance strategies of the robot     

Three-Dimensional Path Planning of a Climbing Robot Using Mixed Integer Linear Programming

The City-Climber robot is a novel wall-climbing robot developed at The City College of New York that has the capability to move on floors, climb walls, walk on ceilings and transit between them. In this paper, we first develop the dynamic model of the City-Climber robot when it travel on different surfaces, i.e., floors, walls and ceilings, respectively. Then, we present a path planning method for the City-Climber robot using mixed integer linear programming (MILP) in three-dimensional (3-D) building environments that consist of objects with primitive geometrical shapes. MILP provides an optimization framework that can directly incorporate dynamic constraints with logical constraints such as obstacle avoidance and waypoint selection. In order to use MILP to solve the obstacle avoidance problem, we simplify and decouple the robot dynamic model into a linear system by introducing a restricting admissible controller. The decoupled model and obstacle can be rewritten as a linear program with mixed-integer linear constraints that account for the collision avoidance. A key benefit of this approach is that the path optimization can be readily solved using the AMPL and CPLEX optimization software with a MATLAB interface. Simulation results show that the framework of MILP is well suited for path planning and obstacle avoidance problems for the wall-climbing robot in 3-D environments.     

Proximity Queries Between Convex Objects: An Interior Point Approach for Implicit Surfaces

This paper presents a general method for exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computation algorithms are particularly important for applications involving objects that make intermittent contact, such as in dynamic simulations and in haptic interactions. They can also be used in the narrow phase of hierarchical collision detection. In contrast to geometric approaches developed for polyhedral objects, we formulate the distance computation problem as a convex optimization problem. We use an interior point method to solve the optimization problem and demonstrate that, for general convex objects represented as implicit surfaces, interior point approaches are globally convergent, and fast in practice. Further, they provide polynomial-time guarantees for implicit surface objects when the implicit surfaces have self-concordant barrier functions. We use a primal-dual interior point algorithm that solves the Karush-Kuhn-Tucker (KKT) conditions obtained from the convex programming formulation. For the case of polyhedra and quadrics, we establish a theoretical time complexity of O(n^1.5), where n is the number of constraints. We present implementation results for example implicit surface objects, including polyhedra, quadrics, and generalizations of quadrics such as superquadrics and hyperquadrics, as well as intersections of these surfaces. We demonstrate that in practice, the algorithm takes time linear in the number of constraints, and that distance computation rates of about 1 kHz can be achieved. We also extend the approach to proximity queries between deforming convex objects. Finally, we show that continuous collision detection for linearly translating objects can be performed by solving two related convex optimization problems. For polyhedra and quadrics, we establish that the computational complexity of this problem is also O(n^1.5).     

Dynamic image sequence analysis using fuzzy measures

In this paper, we present an image understanding system using fuzzy sets and fuzzy measures. This system is based on a symbolic object-oriented image interpretation system. We apply a simple, powerful three-dimensional (3-D) recursive filter to tracking moving objects in a dynamic image sequence. This filter has a time-varying 3-D frequency-planar passband that is adapted in a feedback system to automatically track moving objects. However, as objects in the image sequence are not well-defined and are engaged in dynamic activities, their shapes and trajectories in most cases can be described only vaguely. In order to handle these uncertainties, we use fuzzy measures to capture subtle variations and manage the uncertainties involved. This enables us to develop an image understanding system that produces a very natural output. We demonstrate the effectiveness of our system with complex real traffic scenes.     

High-level control of sound synthesis for sonification processes

Methods of sonification based on the design and control of sound synthesis is presented in this paper. The semiotics of isolated sounds was evidenced by performing fundamental studies using a combined acoustical and brain imaging (event-related potentials) approach. The perceptual cues (which are known as invariants) responsible for the evocations elicited by the sounds generated by impacts, moving sound sources, dynamic events and vehicles (car-door closing and car engine noise) were then identified based on physical and perceptual considerations. Lastly, some examples of the high-level control of a synthesis process simulating immersive 3-D auditory scenes, interacting objects and evoked dynamics are presented.     

3-D shape recovery using distributed aspect matching

An approach to the recovery of 3-D volumetric primitives from a single 2-D image is presented. The approach first takes a set of 3-D volumetric modeling primitives and generates a hierarchical aspect representation based on the projected surfaces of the primitives; conditional probabilities capture the ambiguity of mappings between levels of the hierarchy. From a region segmentation of the input image, the authors present a formulation of the recovery problem based on the grouping of the regions into aspects. No domain-independent heuristics are used; only the probabilities inherent in the aspect hierarchy are exploited. Once the aspects are recovered, the aspect hierarchy is used to infer a set of volumetric primitives and their connectivity. As a front end to an object recognition system, the approach provides the indexing power of complex 3-D object-centered primitives while exploiting the convenience of 2-D viewer-centered aspect matching; aspects are used to represent a finite vocabulary of 3-D parts from which objects can be constructed     

多特征组合和图切割支持的物体/背景分割方法

运动物体分割是计算机视觉应用领域中的一个基本问题,阴影和亮度变化均易造成分割结果错误.通过组合多种图像特征,实现了一种新的检测运动物体方法.一方面,组合图像的颜色、梯度和纹理特征,利用梯度和纹理信息时亮度变化不敏感的特性,提高运动物体分割的准确性;另一方面,使用图切割算法对物体/背景进行分割,在不影响整体分割结果前提下修正局部判别错误的像素点,分割结果噪声少且稳定性强.对不同场景的分割结果表明,该方法是高效的和实用的.     

Qualitative detection of motion by a moving observer

Two complementary methods for the detection of moving objects by a moving observer are described. The first is based on the fact that, in a rigid environment, the projected velocity at any point in the image is constrained to lie on a 1-D locus in velocity space whose parameters depend only on the observer motion. If the observer motion is known, an independently moving object can, in principle, be detected because its projected velocity is unlikely to fall on this locus. We show how this principle can be adapted to use partial information about the motion field and observer motion that can be rapidly computed from real image sequences. The second method utilizes the fact that the apparent motion of a fixed point due to smooth observer motion changes slowly, while the apparent motion of many moving objects such as animals or maneuvering vehicles may change rapidly. The motion field at a given time can thus be used to place constraints on the future motion field which, if violated, indicate the presence of an autonomously maneuvering object. In both cases, the qualitative nature of the constraints allows the methods to be used with the inexact motion information typically available from real-image sequences. Implementations of the methods that run in real time on a parallel pipelined image processing system are described.     

三维动态环境下多无人机编队分布式保持控制

针对无人机编队沿参考轨迹飞行时遭遇突发障碍物而发生碰撞的问题, 提出一种可实时避障及机间避碰的分布式编队保持算法. 基于虚拟结构编队策略, 采用非线性模型预测控制(NMPC) 方法设计分布式编队控制器. 为了实现通讯延迟下的机间避碰, 采用基于不同优先级的改进避碰惩罚策略. 仿真结果表明, 所设计的分布式编队控制器能保证编队及时避开环境中的突发障碍物, 且无人机间不发生互碰, 避障后的各编队继续以原队形沿参考轨迹飞行.

     

On multiple moving objects

This paper explores the motion-planning problem for multiple moving objects. The approach taken consists of assigning priorities to the objects, then planning motions one object at a time. For each moving object, the planner constructs a configuration space-time that represents the time-varying constraints imposed on the moving object by the other moving and stationary objects. The planner represents this space-time approximately, using two-dimensional slices. The space-time is then searched for a collision-free path. The paper demonstrates this approach in two domains. One domain consists of translating planar objects; the other domain consists of two-link planar articulated arms.     

Moving vehicles detection based on adaptive motion histogram

As one of the important topics in computer vision, moving vehicle segmentation has attracted considerable attention of researchers. However, robust detection is hampered by the interferential moving objects in dynamic scenes. In this paper, we address the problem of the moving vehicles segmentation in the dynamic scenes. Based on the distinct motion property of the dynamic background and that of the moving vehicles, we present an adaptive motion histogram for moving vehicles segmentation. The presented algorithm consists of two procedures: adaptive background update and motion histogram-based vehicles segmentation. In the adaptive background update procedure, we make use of the lighting change of the scene and present a novel method for background evolving. In the motion histogram-based vehicles segmentation procedure, an adaptive motion histogram is maintained and updated according to the motion information in the scenes, and the moving vehicles are then detected according to the motion histogram maintained. Experimental results of typical scenes demonstrate robustness of the proposed method. Quantitative evaluation and comparison with the existing methods show that the proposed method provides much improved results.     

Efficient collision detection using bounding volume hierarchies ofk-DOPs

Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within the environment. In addition to determining accurately the contacts that occur between pairs of objects, one needs also to do so at real-time rates. Applications such as haptic force feedback can require over 1000 collision queries per second. We develop and analyze a method, based on bounding-volume hierarchies, for efficient collision detection for objects moving within highly complex environments. Our choice of bounding volume is to use a discrete orientation polytope (k-DOP), a convex polytope whose facets are determined by halfspaces whose outward normals come from a small fixed set of k orientations. We compare a variety of methods for constructing hierarchies (BV-trees) of bounding k-DOPs. Further, we propose algorithms for maintaining an effective BV-tree of k-DOPs for moving objects, as they rotate, and for performing fast collision detection using BV-trees of the moving objects and of the environment. Our algorithms have been implemented and tested. We provide experimental evidence showing that our approach yields substantially faster collision detection than previous methods     

Motion segmentation and qualitative dynamic scene analysis from an image sequence

This article deals with analysis of the dynamic content of a scene from an image sequence irrespective of the static or dynamic nature of the camera. The tasks involved can be the detection of moving objects in a scene observed by a mobile camera, or the identification of the movements of some relevant components of the scene relatively to the camera. This problem basically requires a motion-based segmentation step. We present a motion-based segmentation method relying on 2-D affine motion models and a statistical regularization approach which ensures stable motion-based partitions. This can be done without the explicit estimation of optic flow fields. Besides these partitions are linked in time. Therefore, the motion interpretation process can be performed on more than two successive frames. The ability to follow a given coherently moving region within an interval of several images of the sequence makes the interpretation process more robust and more comprehensive. Identification of the kinematic components of the scene is induced from an intermediate layer accomplishing a generic qualitative motion labeling. No 3-D measurements are required. Results obtained on several real-image sequences corresponding to complex outdoor situations are reported.     

Solid reconstruction using recognition of quadric surfaces from orthographic views

The reconstruction of 3D objects from 2D orthographic views is crucial for maintaining and further developing existing product designs. A B-rep oriented method for reconstructing curved objects from three orthographic views is presented by employing a hybrid wire-frame in place of an intermediate wire-frame. The Link-Relation Graph (LRG) is introduced as a multi-graph representation of orthographic views, and quadric surface features (QSFs) are defined by special basic patterns of LRG as well as aggregation rules. By hint-based pattern matching in the LRGs of three orthographic views in an order of priority, the corresponding QSFs are recognized, and the geometry and topology of quadric surfaces are recovered simultaneously. This method can handle objects with interacting quadric surfaces and avoids the combinatorial search for tracing all the quadric surfaces in an intermediate wire-frame by the existing methods. Several examples are provided.     

Reactive Path Planning in a Dynamic Environment

This paper deals with the problem of path planning in a dynamic environment, where the workspace is cluttered with unpredictably moving objects. The concept of the virtual plane is introduced and used to create reactive kinematic-based navigation laws. A virtual plane is an invertible transformation equivalent to the workspace, which is constructed by using a local observer. This results in important simplifications of the collision detection process. Based on the virtual plane, it is possible to determine the intervals of the linear velocity and the paths that lead to collisions with moving obstacles and then derive a dynamic window for the velocity and the orientation to navigate the robot safely. The speed of the robot and the orientation angle are controlled independently using simple collision cones and collision windows constructed from the virtual plane. The robot's path is controlled using kinematic-based navigation laws that depend on navigation parameters. These parameters are tuned in real time to adjust the path of the robot. Simulation is used to illustrate collision detection and path planning.      

Adaptive dynamic collision checking for single and multiple articulated robots in complex environments

Static collision checking amounts to testing a given configuration of objects for overlaps. In contrast, the goal of dynamic checking is to determine whether all configurations along a continuous path are collision-free. While there exist effective methods for static collision detection, dynamic checking still lacks methods that are both reliable and efficient. A common approach is to sample paths at some fixed, prespecified resolution and statically test each sampled configuration. But this approach is not guaranteed to detect collision whenever one occurs, and trying to increase its reliability by refining the sampling resolution along the entire path results in slow checking. This paper introduces a new method for testing path segments in c-space or collections of such segments, that is both reliable and efficient. This method locally adjusts the sampling resolution by comparing lower bounds on distances between objects in relative motion with upper bounds on lengths of curves traced by points of these moving objects. Several additional techniques and heuristics increase the checker's efficiency in scenarios with many moving objects (e.g., articulated arms and/or multiple robots) and high geometric complexity. The new method is general, but particularly well suited for use in probabilistic roadmap (PRM) planners, where it is critical to determine as quickly as possible whether given path segments collide, or not. Extensive tests, in particular on randomly generated path segments and on multisegment paths produced by PRM planners, show that the new method compares favorably with a fixed-resolution approach at "suitable" resolution, with the enormous advantage that it never fails to detect collision.     

Intelligent collision avoidance planning of a robot manipulator whose workspace includes moving objects

The collision avoidance problem of a robot manipulator whose workspace includes moving objects is considered in this paper. It is shown that the proposed computer simulation system can be used in a dialogue mode with a designer to check whether or not collision with obstacles is avoided and to determine the appropriate movement.     

On-line Planning for Collision Avoidance on the Nominal Path

In this paper a solution to the obstacle avoidance problem for a mobile robot moving in the two-dimensional Cartesian plane is presented. The robot is modelled as a linear time-invariant dynamic system of finite size enclosed by a circle and the obstacles are modelled as circles travelling along rectilinear trajectories. This work deals with the avoidance problem when the obstacles move in known trajectories. The robot starts its journey on a nominal straight line path with a nominal velocity. When an obstacle is detected to be on a collision course with the robot, the robot must devise a plan to avoid the obstacle whilst minimising a cost index defined as the total sum squared of the magnitudes of the deviations of its velocity from the nominal velocity. The planning strategy adopted here is adjustment of the robot's velocity on the nominal path based on the time of collision between the robot and a moving obstacle, and determination of a desired final state such that its Euclidean distance from the nominal final state is minimal. Obstacle avoidance by deviation from the nominal path in deterministic and random environments is based on the work presented here and is investigated in another paper.     

Trajectory-Tracking and Path-Following of Underactuated Autonomous Vehicles With Parametric Modeling Uncertainty

We address the problem of position trajectory-tracking and path-following control design for underactuated autonomous vehicles in the presence of possibly large modeling parametric uncertainty. For a general class of vehicles moving in either 2- or 3-D space, we demonstrate how adaptive switching supervisory control can be combined with a nonlinear Lyapunov-based tracking control law to solve the problem of global boundedness and convergence of the position tracking error to a neighborhood of the origin that can be made arbitrarily small. The desired trajectory does not need to be of a particular type (e.g., trimming trajectories) and can be any sufficiently smooth bounded curve parameterized by time. We also show how these results can be applied to solve the path-following problem, in which the vehicle is required to converge to and follow a path, without a specific temporal specification. We illustrate our design procedures through two vehicle control applications: a hovercraft (moving on a planar surface) and an underwater vehicle (moving in 3-D space). Simulations results are presented and discussed.