Path feasibility and modification

نویسندگان

  • Kuu-Young Young
  • Chi-Haur Wu
چکیده

Kinematic feasibility of a planned robot path is restrained by the kinematic constraints of the robot executing the task, such as workspace, configuration, and singularity. Since these kinematic constraints can be described utilizing the geometry of the given robot, corresponding regions within the robot workspace can be expressed in geometrical representation. Consequently, geometric information can be derived from the planned path and the geometric boundaries of these regions. Then, by utilizing the geometric information and proper modification strategies, a Cartesian robot path that is kinematically infeasible can be modified according to different task requirements. To demonstrate the proposed feasibility and modification schemes, simulations for a 6R robot manipulator are executed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modification of Reasoned Action Theory and comparison with the original version by path analysis for substance abuse prevention among adolescents

Introduction: Objective of present study was assessing the competence of self efficacy to development of theory of Reasoned Action (TRA) and comparison with original version by path analysis for substance abuse prevention among adolescents. Methods: In this analytic study, 433 randomly selected adolescents (range of age 15–19) from Tehran participated in study. The study design was based ...

متن کامل

Feasibility analysis of land use modification for low yield rain fed lands in Kermanshah Province through almond cultivation using water harvesting methods and its impact on soil degradation control and soil productivity improvement

Soil productivity decline caused by inappropriate land use and human factors is the main threat to the functioning of soil resources and ecosystems in different regions of Iran, especially in Kermanshah Province. This research was designed to evaluate the effectiveness almond cultivation with a surface and subsurface harvesting system in improving soil permeability and inhibition of soil erosio...

متن کامل

A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

متن کامل

Algorithm for shortest path search in Geographic Information Systems by using reduced graphs

The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra's algorithm is one of the classic shortest path search algorithms. This algorithm is not well suited for s...

متن کامل

An Empirical Study of Path Feasibility Queries

In this paper we present a comparative study of path feasibility queries generated during path exploration based software engineering methods. Symbolic execution based methods are gaining importance in different aspects of software engineering e.g. proving properties about programs, test case generation, comparing different executions of programs. These methods use SMT solvers to check the sati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Field Robotics

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1992