The problem of planning motions offline for a robot in the presence of obstacles via an algorithm that does not proceed by a discretization of the search space involves defining good heuristics to characterize the pro...
详细信息
The problem of planning motions offline for a robot in the presence of obstacles via an algorithm that does not proceed by a discretization of the search space involves defining good heuristics to characterize the proximal relationships between two rigid bodies and the development of algorithms for their computation. Several measures are presented, and schemes for their computation are developed. The performances of the algorithms are determined in terms of their running time. The advantage of the fuzzy model is that it lends itself easily to numerical computation involving manipulation of the coordinates of the extreme points.< >
The kinematic path planning problem of a nonholonomic system can be posed as a point-to-point control problem of a nonlinear system. This system has the property that it is not locally stabilizable but is globally con...
详细信息
The kinematic path planning problem of a nonholonomic system can be posed as a point-to-point control problem of a nonlinear system. This system has the property that it is not locally stabilizable but is globally controllable. The authors present a new algorithm for constructing a feasible path between specified initial and final configurations. The algorithm iteratively warps the entire path until all the constraints are satisfied. Polyhedral constraints in both configuration and nonconfiguration spaces (possibly nonconvex) can also be incorporated in this framework. The algorithm is based on the assumption that the system is usually controllable about a nontrivial trajectory, which is true for many cases. An initial trajectory is iteratively warped until the desired final configuration is reached. Examples of a front-wheel driven car and of tractors with one, two, and three trailers are included to illustrate the efficacy of the proposed algorithm.< >
Probability density functions (PDFs) are derived for many of the geometric measurements upon which stereo matching techniques are based, including orientation differences between matching line segments or curves, the ...
详细信息
Probability density functions (PDFs) are derived for many of the geometric measurements upon which stereo matching techniques are based, including orientation differences between matching line segments or curves, the gradient of disparity, the directional derivative of disparity, and disparity differences between matches. The PDFs resulting from the transformations are used to critically examine many existing stereo techniques. Several techniques based on these PDFs are proposed.< >
Fast procedures for computing fuzzy proximity measures between a multifingered robot hand and an object to be grasped are presented. T.N. Nguyen and H.E. Stephanou (1990) presented a fuzzy approach for prehension, ide...
详细信息
Fast procedures for computing fuzzy proximity measures between a multifingered robot hand and an object to be grasped are presented. T.N. Nguyen and H.E. Stephanou (1990) presented a fuzzy approach for prehension, identified sources of fuzziness, and proposed a fuzzy algorithm for multifingered prehension. These ideas are extended by assuming fuzziness in the object location and geometric hand configuration, computing information on proximity of the hand and object, analyzing the computational efficiencies, and indicating how geometric information can be used in the process of prehension. The implementation details are outlined. The computation is useful in grasp planning and in analyzing the local behavior of the robot hand in the vicinity of the object.< >
A system for exhaustively inspecting a workpiece, not merely certain features, is presented. The system is based on comparing a volumetric representation of a reference object to a volumetric representation of an actu...
详细信息
A system for exhaustively inspecting a workpiece, not merely certain features, is presented. The system is based on comparing a volumetric representation of a reference object to a volumetric representation of an actual object iteratively created from sensor data. The use of volumetric representations gives this approach a number of distinct advantages over the more traditional boundary-based inspection methods. The method is capable of handling arbitrarily complex geometries and does not rely on the identification of features. It lends itself naturally to a multisensor environment, and facilitates true 3-D inspection as opposed to methods that require dimensional reductions of data by projection onto a 2-D plane. The authors focus on an important aspect of volumetric inspection which is the automatic generation of a sequence of sensor operations that will acquire the complete geometry of the object being inspected.< >
The kinematic path planning problem of a nonholonomic system can be posed as a point-to-point control problem of a nonlinear system. This system has the property that it is not locally stabilizable but is globally con...
详细信息
The kinematic path planning problem of a nonholonomic system can be posed as a point-to-point control problem of a nonlinear system. This system has the property that it is not locally stabilizable but is globally controllable. In this paper, we present a new algorithm for constructing a feasible path between specified initial and final configurations. Polyhedral constraints in both configuration and non-configuration spaces (possibly non-convex) can also be incorporated in this framework. The algorithm is based on the assumption that the system is usually controllable about a non-trivial trajectory, which is true for many cases. An initial trajectory is iteratively warped until the desired final configuration is reached. Examples of a front-wheel driven car, and tractors with one, two, and three trailers are included to illustrate the efficacy of the proposed algorithm.
An optimal control formulation of the problem of collision avoidance of mobile robots moving in general terrains containing moving obstscles is presented. A dynamic model of the mobile robot and the dynamic constraint...
详细信息
An optimal control formulation of the problem of collision avoidance of mobile robots moving in general terrains containing moving obstscles is presented. A dynamic model of the mobile robot and the dynamic constraints are derived. Collision avoidance is guaranteed if the minimum distance between the robot and the objects is nonzero. A nominal trajectory is assumed to be known from off-line planning. The main idea is to change the velocity along the nominal trajectory so that collisions are avoided. Furthermore, time consistency with the nominal plan is desirable. A numerical solution of the optimization problem is obtained. A perturbation control type of approach is used to update the optimal plan. Simulation results verify the value of the proposed strategy.
暂无评论