scispace - formally typeset
Search or ask a question
Topic

Obstacle

About: Obstacle is a research topic. Over the lifetime, 9517 publications have been published within this topic receiving 94760 citations. The topic is also known as: impediment & barrier.


Papers
More filters
Proceedings ArticleDOI
06 May 2013
TL;DR: A method to detect relative size changes of image patches that is able to detect size changes in the absence of optical flow is developed and used in autonomous flight tests on a small quadrotor.
Abstract: Obstacle avoidance is desirable for lightweight micro aerial vehicles and is a challenging problem since the payload constraints only permit monocular cameras and obstacles cannot be directly observed. Depth can however be inferred based on various cues in the image. Prior work has examined optical flow, and perspective cues, however these methods cannot handle frontal obstacles well. In this paper we examine the problem of detecting obstacles right in front of the vehicle. We developed a method to detect relative size changes of image patches that is able to detect size changes in the absence of optical flow. The method uses SURF feature matches in combination with template matching to compare relative obstacle sizes with different image spacing. We present results from our algorithm in autonomous flight tests on a small quadrotor. We are able to detect obstacles with a frame-to-frame enlargement of 120% with a high confidence and confirmed our algorithm in 20 successful flight experiments. In future work, we will improve the control algorithms to avoid more complicated obstacle configurations.

156 citations

Patent
13 Mar 2003
TL;DR: In this paper, an obstacle recognition system is presented which can recognize an obstacle by accurately extracting a floor surface from the ground-contact plane of a robot by using a disparity image and homogeneous transform matrix.
Abstract: An obstacle recognition apparatus is provided which can recognize an obstacle by accurately extracting a floor surface. It includes a distance image generator ( 222 ) to produce a distance image using a disparity image and homogeneous transform matrix, a plane detector ( 223 ) to detect plane parameters on the basis of the distance image from the distance image generator ( 222 ), a coordinate transformer ( 224 ) to transform the homogeneous transform matrix into a coordinate of a ground-contact plane of a robot apparatus ( 1 ), and a floor surface detector ( 225 ) to detect a floor surface using the plane parameters from the plane detector ( 223 ) and result of coordinate transformation from the coordinate transformer ( 224 ) and supply the plane parameters to an obstacle recognition block ( 226 ). The obstacle recognition block ( 226 ) selects one of points on the floor surface using the plane parameters of the floor surface detected by the floor surface detector ( 225 ) and recognizes an obstacle on the basis of the selected point.

156 citations

Journal ArticleDOI
Hongyan Guo1, Chen Shen1, Hui Zhang2, Hong Chen1, Rui Jia1 
TL;DR: The results illustrate that the proposed MPC-based simultaneous trajectory planning and tracking approach achieves acceptable obstacle avoidance performance for an intelligent vehicle.
Abstract: As a typical example of cyber-physical systems, intelligent vehicles are receiving increasing attention, and the obstacle avoidance problem for such vehicles has become a hot topic of discussion. This paper presents a simultaneous trajectory planning and tracking controller for use under cruise conditions based on a model predictive control (MPC) approach to address obstacle avoidance for an intelligent vehicle. The reference trajectory is parameterized as a cubic function in time and is determined by the lateral position and velocity of the intelligent vehicle and the velocity and yaw angle of the obstacle vehicle at the start point of the lane change maneuver. Then, the control sequence for the vehicle is incorporated into the expression for the reference trajectory that is used in the MPC optimization problem by treating the lateral velocity of the intelligent vehicle at the end point of the lane change as an intermediate variable. In this way, trajectory planning and tracking are both captured in a single MPC optimization problem. To evaluate the effectiveness of the proposed simultaneous trajectory planning and tracking approach, joint veDYNA-Simulink simulations were conducted in the unconstrained and constrained cases under leftward and rightward lane change conditions. The results illustrate that the proposed MPC-based simultaneous trajectory planning and tracking approach achieves acceptable obstacle avoidance performance for an intelligent vehicle.

153 citations

Proceedings ArticleDOI
08 Dec 2003
TL;DR: This concept is very general and can be useful both for navigation and motion planning purposes (for its own safety, a robotic system should never find itself in an inevitable collision state) and is illustrated by a safe motion planning example.
Abstract: An inevitable collision state for a robotic system can be defined as a state for which, no matter what the future trajectory followed by the system is, a collision with an obstacle eventually occurs. An inevitable collision state takes into account both the dynamics of the system and the obstacles, fixed or moving. The main contribution of this paper is to lay down and explore this novel concept (and the companion concept of inevitable collision obstacle). Formal definitions of the inevitable collision states and obstacles are given. Properties fundamental for their characterisation are established. This concept is very general and can be useful both for navigation and motion planning purposes (for its own safety, a robotic system should never find itself in an inevitable collision state). The interest of this concept is illustrated by a safe motion planning example.

153 citations

Journal ArticleDOI
01 Dec 1987
TL;DR: An algorithm is presented to navigate a robot in an unexplored terrain that is arbitrarily populated with disjoint convex polygonal obstacles in the plane and it is proven to yield a convergent solution to each path of traversal.
Abstract: The problem of navigating an autonomous mobile robot through unexplored terrain of obstacles is discussed. The case when the obstacles are "known" has been extensively studied in literature. Completely unexplored obstacle terrain is considered. In this case, the process of navigation involves both learning the information about the obstacle terrain and path planning. An algorithm is presented to navigate a robot in an unexplored terrain that is arbitrarily populated with disjoint convex polygonal obstacles in the plane. The navigation process is constituted by a number of traversals; each traversal is from an arbitrary source point to an arbitrary destination point. The proposed algorithm is proven to yield a convergent solution to each path of traversal. Initially, the terrain is explored using a rather primitive sensor, and the paths of traversal made may be suboptimal. The visibility graph that models the obstacle terrain is incrementally constructed by integrating the information about the paths traversed so far. At any stage of learning, the partially learned terrain model is represented as a learned visibility graph, and it is updated after each traversal. It is proven that the learned visibility graph converges to the visibility graph with probability one when the source and destination points are chosen randomly. Ultimately, the availability of the complete visibility graph enables the robot to plan globally optimal paths and also obviates the further usage of sensors.

150 citations


Network Information
Related Topics (5)
Nonlinear system
208.1K papers, 4M citations
79% related
Artificial neural network
207K papers, 4.5M citations
78% related
Fuzzy logic
151.2K papers, 2.3M citations
77% related
Software
130.5K papers, 2M citations
77% related
Optimization problem
96.4K papers, 2.1M citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
20231,483
20223,389
2021407
2020817
2019873