2001
DOI: 10.1016/s0952-1976(01)00027-6
|View full text |Cite
|
Sign up to set email alerts
|

Robot planning and re-planning using decomposition, abstraction, deduction, and prediction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 28 publications
0
6
0
Order By: Relevance
“…There are two ways to deal with complicated end-effector constraints. One is to explore the equations of end-effector constraints as in Equation (1). The other is to fit complex end-effector motions by linear and circular motions.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…There are two ways to deal with complicated end-effector constraints. One is to explore the equations of end-effector constraints as in Equation (1). The other is to fit complex end-effector motions by linear and circular motions.…”
Section: Discussionmentioning
confidence: 99%
“…First of all, the corresponding Cartesian paths meet the end-effector constraints defined in Equation (1). In Cartesian space, the end-effector moves the shortest paths that are usually not linear paths.…”
Section: Predictable Trajectory Planning With End-effector Constraintsmentioning
confidence: 99%
See 2 more Smart Citations
“…Figure shows the path for a synthetic scenario. If the environment has static sensors and computing devices, which monitor the change in environment (excluding dynamic and small obstacles) at some low frequency, and there exists some mechanism to inform the same to the robot, the search performed may be repeated at every change informed . The immediate position may be used as the source.…”
Section: Algorithmmentioning
confidence: 99%