A Heuristic Application-Specific Path Planner for Robot Motion Planning

Author(s):  
David G. Alciatore

Abstract This paper presents the development and simulation results of a Heuristic Application-Specific Path Planner (HASPP) that can be used to automatically plan trajectories for a manipulator operating around obstacles. Since the implementation of HASPP is inherently application-specific due to dependence on heuristics, the application of HASPP to an eight degree of freedom Pipe Manipulator is presented as an illustrative example. This development and simulation was implemented on a Silicon Graphics Personal IRIS with the aid of WALKTHRU, a 3-D simulation and animation tool, and software developed in C. HASPP uses extensive knowledge of the manipulator’s workspace and makes certain assumptions about the environment in finding trajectories. The algorithm also makes use of the manipulator’s redundant degrees of freedom to avoid obstacles and joint limits during the trajectory while obtaining a heuristic near-optimal solution. The algorithm is rule-based, governed by heuristics and well-defined geometric tests, providing extremely fast results. It finds “good” trajectories that are optimal within the defined heuristics. When a trajectory is not feasible for the given geometry, the algorithm offers a diagnosis of the limiting constraints. The Pipe Manipulator HASPP implementation has been tested thoroughly with the computer graphics model and it has demonstrated the ability to reliably determine near-optimal collision-free erection trajectories completely automatically. No other planning techniques available in the literature have demonstrated the ability to solve problems as complex as the example presented here. The use of HASPP with simulation offers many application opportunities including plant design constructability studies, assembly and maintenance planning, pre-planning and pre-programming of equipment tasks, and equipment operator assistance. This work was the result of construction automation research sponsored by the National Science Foundation.

Author(s):  
Jens Claßen ◽  
James Delgrande

With the advent of artificial agents in everyday life, it is important that these agents are guided by social norms and moral guidelines. Notions of obligation, permission, and the like have traditionally been studied in the field of Deontic Logic, where deontic assertions generally refer to what an agent should or should not do; that is they refer to actions. In Artificial Intelligence, the Situation Calculus is (arguably) the best known and most studied formalism for reasoning about action and change. In this paper, we integrate these two areas by incorporating deontic notions into Situation Calculus theories. We do this by considering deontic assertions as constraints, expressed as a set of conditionals, which apply to complex actions expressed as GOLOG programs. These constraints induce a ranking of "ideality" over possible future situations. This ranking in turn is used to guide an agent in its planning deliberation, towards a course of action that adheres best to the deontic constraints. We present a formalization that includes a wide class of (dyadic) deontic assertions, lets us distinguish prima facie from all-things-considered obligations, and particularly addresses contrary-to-duty scenarios. We furthermore present results on compiling the deontic constraints directly into the Situation Calculus action theory, so as to obtain an agent that respects the given norms, but works solely based on the standard reasoning and planning techniques.


2016 ◽  
Vol 8 (6) ◽  
Author(s):  
Joshua T. Bryson ◽  
Xin Jin ◽  
Sunil K. Agrawal

Designing an effective cable architecture for a cable-driven robot becomes challenging as the number of cables and degrees of freedom of the robot increase. A methodology has been previously developed to identify the optimal design of a cable-driven robot for a given task using stochastic optimization. This approach is effective in providing an optimal solution for robots with high-dimension design spaces, but does not provide insights into the robustness of the optimal solution to errors in the configuration parameters that arise in the implementation of a design. In this work, a methodology is developed to analyze the robustness of the performance of an optimal design to changes in the configuration parameters. This robustness analysis can be used to inform the implementation of the optimal design into a robot while taking into account the precision and tolerances of the implementation. An optimized cable-driven robot leg is used as a motivating example to illustrate the application of the configuration robustness analysis. Following the methodology, the effect on robot performance due to design variations is analyzed, and a modified design is developed which minimizes the potential performance degradations due to implementation errors in the design parameters. A robot leg is constructed and is used to validate the robustness analysis by demonstrating the predicted effects of variations in the design parameters on the performance of the robot.


2005 ◽  
Vol 128 (4) ◽  
pp. 747-754 ◽  
Author(s):  
David E. Foster ◽  
Raymond J. Cipra

This paper examines the problem of identifying the assembly configurations (ACs), also called circuits, of planar multi-loop mechanisms with kinematic limitations, such as joint limits, link interference, collision with stationary obstacles, and constraint regions. First, a technique is given to describe numerically the satisfaction or violation of these kinematic limitations, and then it is applied to find the ACs of mechanisms with kinematic limitations. The method is valid for planar mechanisms with one or two degrees of freedom, and is illustrated with two examples.


Author(s):  
Mounir Hammouche ◽  
Philippe Lutz ◽  
Micky Rakotondrabe

The problem of robust and optimal output feedback design for interval state-space systems is addressed in this paper. Indeed, an algorithm based on set inversion via interval analysis (SIVIA) combined with interval eigenvalues computation and eigenvalues clustering techniques is proposed to seek for a set of robust gains. This recursive SIVIA-based algorithm allows to approximate with subpaving the set solutions [K] that satisfy the inclusion of the eigenvalues of the closed-loop system in a desired region in the complex plane. Moreover, the LQ tracker design is employed to find from the set solutions [K] the optimal solution that minimizes the inputs/outputs energy and ensures the best behaviors of the closed-loop system. Finally, the effectiveness of the algorithm is illustrated by a real experimentation on a piezoelectric tube actuator.


1960 ◽  
Vol 64 (599) ◽  
pp. 697-699 ◽  
Author(s):  
R. P. N. Jones ◽  
S. Mahalingam

The Rayleigh-Ritz method is well known as an approximate method of determining the natural frequencies of a conservative system, using a constrained deflection form. On the other hand, if a general deflection form (i.e. an unconstrained form) is used, the method provides a theoretically exact solution. An unconstrained form may be obtained by expressing the deflection as an expansion in terms of a suitable set of orthogonal functions, and in selecting such a set, it is convenient to use the known normal modes of a suitably chosen “ basic system.” The given system, whose vibration properties are to be determined, can then be regarded as a “ modified system,” which is derived from the basic system by a variation of mass and elasticity. A similar procedure has been applied to systems with a finite number of degrees of freedom. In the present note the method is applied to simple non-uniform beams, and to beams with added masses and constraints. A concise general solution is obtained, and an iteration process of obtaining a numerical solution is described.


Author(s):  
Har-Jou Yeh ◽  
Karim A. Abdel-Malek

Abstract An analytical formulation for determining the workspace of a point on a body suspended in a Gimbal mechanism is presented. Although the gimbal mechanism comprises three degrees of freedom, the resulting workspace is a region on a spherical surface. The constraint function of the underlying mechanism is studied for singularities using a row-rank deficiency condition of its constraint Jacobian. Singular curves on the resultant spherical surface are determined by a similar analytical criterion imposed on the system’s subjacobian, to compute a set of two joint singularities. These singular curves define regions on the spherical surface that may or may not be accessible. A perturbation technique is then used to identify singular curve segments that are boundary to the workspace region. The methodology is illustrated through a numerical example.


1999 ◽  
Vol 81 (5) ◽  
pp. 2582-2586 ◽  
Author(s):  
Kiisa C. Nishikawa ◽  
Sara T. Murray ◽  
Martha Flanders

Do arm postures vary with the speed of reaching? For reaching movements in one plane, the hand has been observed to follow a similar path regardless of speed. Recent work on the control of more complex reaching movements raises the question of whether a similar “speed invariance” also holds for the additional degrees of freedom. Therefore we examined human arm movements involving initial and final hand locations distributed throughout the three-dimensional (3D) workspace of the arm. Despite this added complexity, arm kinematics (summarized by the spatial orientation of the “plane of the arm” and the 3D curvature of the hand path) changed very little for movements performed over a wide range of speeds. If the total force (dynamic + quasistatic) had been optimized by the control system (e.g., as in a minimization of the change in joint torques or the change in muscular forces), the optimal solution would change with speed; slow movements would reflect the minimal antigravity torques, whereas fast movements would be more strongly influenced by dynamic factors. The speed-invariant postures observed in this study are instead consistent with a hypothesized optimization of only the dynamic forces.


2020 ◽  
Vol 10 (5) ◽  
pp. 1721
Author(s):  
Petar Ćurković ◽  
Lovro Čehulić

Path planning is present in many areas, such as robotics, video games, and unmanned autonomous vehicles. In the case of robots, it is a primary low-level prerequisite for the successful execution of high-level tasks. It is a known and difficult problem to solve, especially in terms of finding optimal paths for robots working in complex environments. Recently, population-based methods for multi-objective optimization, i.e., swarm and evolutionary algorithms successfully perform on different path planning problems. Knowing the nature of the problem is hard for optimization algorithms, it is expected that population-based algorithms might benefit from some kind of diversity maintenance implementation. However, advantages and potential traps of implementing specific diversity maintenance methods into the evolutionary path planner have not been clearly spelled out and experimentally demonstrated. In this paper, we fill this gap and compare three diversity maintenance methods and their impact on the evolutionary planner for problems of different complexity. Crowding, fitness sharing, and novelty search are tailored to fit specific problems, implemented, and tested for two scenarios: mobile robot operating in a 2D maze, and 3 degrees of freedom (DOF) robot operating in a 3D environment including obstacles. Results indicate that the novelty search outperforms the other two methods for problem domains of higher complexity.


Author(s):  
Chalongrath Pholsiri ◽  
Chetan Kapoor ◽  
Delbert Tesar

This research uses new developments in redundancy resolution and real-time capability analysis to improve the ability of an articulated arm to satisfy task constraints. Task constraints are specified using numerical values of position, velocity, force, and accuracy. Inherent in the definition of task constraints is the number of output constraints that the system needs to satisfy. The relationship of this with the input space (degrees of freedom) defines the ability to optimize manipulator performance. This is done through a Task-Based Redundancy Resolution (TBRR) scheme that uses the extra resources to find a solution that avoids system constraints (joint limits, singularities, etc.) and satisfies task constraints. To avoid system constraints, we use well-understood criteria associated with the constraints. For task requirements, the robot capabilities are estimated based on kinematic and dynamic manipulability analyses. We then compare the robot capabilities with the user-specified requirement values. This eliminates a confusing chore of selecting a proper set of performance criteria for a task at hand. The breakthrough of this approach lies in the fact that it continuously evaluates the relationship between task constraints and system resources, and when possible, improves system performance. This makes it equally applicable to redundant and non-redundant systems. The scheme is implemented using an object-oriented operational software framework and its effectiveness is demonstrated in computer simulations of a 10-DOF manipulator.


Author(s):  
Brian J. Slaboch ◽  
Philip Voglewede

This paper introduces the Underactuated Part Alignment System (UPAS) as a cost-effective and flexible approach to aligning parts in the vertical plane prior to an industrial robotic assembly task. The advantage of the UPAS is that it utilizes the degrees of freedom (DOFs) of a SCARA (Selective Compliant Assembly Robot Arm) type robot in conjunction with an external fixed post to achieve the desired part alignment. Three path planning techniques will be presented that can be used with the UPAS to achieve the proper part rotation.


Sign in / Sign up

Export Citation Format

Share Document