English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In recent years, the interest in human-robot interactions has added a new dimension to the on-line path planning problem by requiring a method that guarantees a risk-free path. This paper presents a streamlined search algorithm for fast path modification. The algorithm is formulated as an optimization problem that evaluates alternative paths nearby each obstacle. Each path is evaluated based on the value of the danger assigned to that path. To reduce the size of the search space, the minimum number of via points necessary to alter the path is initially obtained using a geometrical method. Given the number of via points, the algorithm proceeds to locate the via points around the obstacle such that the resulting path through these via points satisfies all problem constraints. Obtaining a solution in this way renders a fast algorithm for path modification, while it better avoids problems often encountered in other gradient-based search algorithms. Case studies for two planar robots are provided to highlight some of the advantages of the proposed algorithm. Experimental results using a CRS-F3 robot manipulator validate the effectiveness of the algorithm for applications involving human-robot interactions.

A Streamlined Search Algorithm for Path Modifications of a Safe Robot Manipulator *