Elon Rimon

Elon Rimon

Auto-generated profile, based on publicly available information

Elon Rimon

Technion -Israel Institute of Technology 3200003 Haifa Israel

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 1992 in IEEE Transactions on Robotics and Automation
Verified
Journal Article
Closed access
ERE. Rimon
E. Rimon
DKD.E. Koditschek
D.E. Koditschek
A methodology for exact robot motion planning and control that unifies the purely kinematic path planning problem with the lower level feedback controller design is presented. Complete information about a freespace and goal is encoded in the form of a special artificial potential function, called a navigation function, that connects the kinematic planning problem with the dynamic execution problem in a provably correct fashion. The navigation function automatically gives rise to a bounded-torque feedback controller for the robot's actuators that guarantees collision-free motion and convergence to the destination from almost all initial free configurations. A formula for navigation functions that guide a point-mass robot in a generalized sphere world is developed. The simplest member of this family is a space obtained by puncturing a disk by an arbitrary number of smaller disjoint disks representing obstacles. The other spaces are obtained from this model by a suitable coordinate transformation. Simulation results for planar scenarios are provided.

1 December 1990 in Advances in Applied Mathematics
Verified
Journal Article
Closed access
DKDaniel E Koditschek
Daniel E Koditschek
ERElon Rimon
Elon Rimon

1 October 2001 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
YGYoav Gabriely
Yoav Gabriely
ERElon Rimon
Elon Rimon

1 September 1998 in The International Journal of Robotics Research
Verified
Journal Article
Closed access
PDF file
IKIshay Kamon
Ishay Kamon
ERElon Rimon
Elon Rimon
EREhud Rivlin
Ehud Rivlin
The Bug family algorithms navigate a 2-DOF mobile robot in a completely unknown environment using sensors. TangentBug is a new algorithm in this family, specifically designed for using a range sensor. TangentBug uses the range data to compute a locally short est path, based on a novel structure termed the local tangent graph (LTG). The robot uses the LTG for choosing the locally optimal di rection while moving toward the target, and for making local short- cuts and testing a leaving condition while moving along an obstacle boundary. The transition between these two modes of motion is governed by a globally convergent criterion, which is based on the distance of the robot from the target. We analyze the properties of TangentBug, and present simulation results that show that Tangent Bug consistently performs better than the classical Bug algorithms. The simulation results also show that TangentBug produces paths that in simple environments approach the globally optimal path, as the sensor's maximal detection-range increases. The algorithm can be readily implemented on a mobile robot, and we discuss one such implementation.

1 April 2003 in Computational Geometry
Verified
Journal Article
Closed access
YGYoav Gabriely
Yoav Gabriely
ERElon Rimon
Elon Rimon

25 June 2003
Verified
Conference Paper
Closed access
YGY. Gabriely
Y. Gabriely
ERE. Rimon
E. Rimon
We describe an on-line sensor based algorithm for covering planar areas by a square-shaped tool attached to a mobile robot. Let D be the tool size. The algorithm, called Spiral-STC, incrementally subdivides the planar work-area into disjoint D-size cells, while following a spanning tree of the resulting grid. The algorithm covers general grid environments using a path whose length is at most (n + m)D, where n is the number of D-size cells and m /spl les/ n is the number of boundary cells, defined as cells that share at least one point with the grid boundary. We also report that any on-line coverage algorithm generates a covering path whose length is at least (2 - /spl epsiv/)l/sub opt/ in the worst case, where l/sub opt/ is the length of the optimal covering path. Since (n + m)D /spl les/ 2l/sub opt/, Spiral-STC is worst-case optimal. Moreover, m << n in practical environments, and the algorithm generates close-to-optimal covering paths in such environments. Simulation results demonstrate the spiral-like covering patterns typical to the algorithm.