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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Finding a way in a given maze is a common problem for mobile robots. Many routing algorithms are presented to solve the maze, but they usually propose a theoretical algorithm which can not be well applied to realistic problem. The biggest obstacle to practical use is to build the model in accordance with the true scale of the robot and the maze. In this study, we present a new path routing approach for mobile robots to get an intuitive filled path, which can solve the difficulty of modelling and be well applied to realistic problem. This approach is based on an optimized representation method of the maze. Specifically, we encoded adjacent pixels of same row into a segment, then use four basic elements in a column of a coded matrix to represent the segment information. Finally, an A* like algorithm is applied to the coded matrix to obtain filled path. The proposed method has a high compression rate and is capable to form a walkable domain for robots instead of a single shortest path. Also, we compared this algorithm with many classical maze coding methods and routing algorithms, the result shows the effectiveness and efficiency of our approach in compression rate and maze-solving time. Furthermore, many practical engineering fields can utilize this approach where it is a priority to find a walkable path in a relatively short time.

A Novel Maze Representation Approach for Finding Filled Path of A Mobile Robot