## Abstract

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem is incorporated in the framework of an in-line motion planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning the deterministic problem, where the information about the objects is assumed to be certain is examined. If instead of the Euclidean norm, L_{1} or L_{∞} norms are used to represent distance, the problem becomes a linear programming problem. The stochastic problem is formulated, where the uncertainty is induced by the visual feedback and the unknown dynamics of the moving obstacles. Two problems are considered: First, an optimal filtering of the minimum distance between the robot and the moving object, at the present time. Second, an optimal prediction of the minimum distance in the future, in order to predict possible collisions with the moving obstacles and estimate the collision time.

Original language | English (US) |
---|---|

Pages | 93-98 |

Number of pages | 6 |

State | Published - 1991 |

Event | Proceedings of the 11th Triennial World Congress of the International Federation of Automatic Control - Tallinn, USSR Duration: Aug 13 1990 → Aug 17 1990 |

### Conference

Conference | Proceedings of the 11th Triennial World Congress of the International Federation of Automatic Control |
---|---|

City | Tallinn, USSR |

Period | 8/13/90 → 8/17/90 |

## ASJC Scopus subject areas

- General Engineering