FNUG: Imperfect Mazes Traversal Based on Detecting and Following the Nearest-to-Final-Goal and Unvisited Gaps

Ullah, Zakir; Chen, Xiaopeng; Gou, Siyuan; Xu, Yang; Salam, Mohammed Abdus

doi:10.1109/lra.2022.3151393

Cited by 6 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the above conjecture, the optimal solution is obtained when the 𝛽 𝑖 is fixed at 90°, and the approximate range of the total number 𝑛 and the total length of the measured lines is determined [4]. Set the coast length of the east and west coasts as 𝑚 1 , and the coast length of the north and south coasts as 𝑚 2 , and simulate the survey line process between the north and south coasts as a top view, as shown in Figure 5, then the voyage of the survey ship in the following figure can be divided into two situations: first, it starts from the north bank and stops from the south bank, and the survey line reaches both sides completely; The second is the north coast, but did not reach the south coast, the end of the east or West coast.…”

Section: Establishment Of Target Modelmentioning

confidence: 99%

Research on Multi-Beam Line Finding Problem and Optimal Line Finding Path based on Exhaustion Method

2024

FCIS

View full text Add to dashboard Cite

In this paper, the multi-beam line measurement problem is studied, solving the relevant data of different seabed slope and line measurement, and establishing a multi-beam line measurement model based on it, simulating the work of multi-beam line measurement, using ergodic and iterative algorithms, to achieve the best line measurement path design and calculation of uneven sea area. First of all, the mathematical model of multi-beam line surveying with variable direction of line surveying is obtained through geometric relation and sine and cosine theorem, etc., and the coverage width , overlap rate between lines and sea depth of measuring ships at different positions are solved. Secondly, the characteristics of sea terrain are analyzed, and the variation law of the coverage width of the measured line with the angle of the measured line direction is explored. Finally, whether the beginning and end points of the survey line reach the north and south banks is classified and discussed, and the traversal calculation method is designed to exhaustively explore all possible points and solve the minimum points.

show abstract

Section: Establishment Of Target Modelmentioning

confidence: 99%

Research on Multi-Beam Line Finding Problem and Optimal Line Finding Path based on Exhaustion Method

2024

FCIS

View full text Add to dashboard Cite

show abstract

“…A study by Ullah et al [10] proposed the Nearestto-Final Goal and Unvisited Gap (FNUG), a novel gap-based strategy for traversal imperfect-unknown mazes. The technique is computationally efficient and can handle loops and dead ends thanks to the revisit Jurnal Infotel, Vol.…”

Section: Introductionmentioning

confidence: 99%

Room cleaning robot movement using A* algorithm and imperfect maze

et al. 2023

View full text Add to dashboard Cite

Cleanliness is a mandatory requirement to help prevent virus spread. The cleaning process can be done automatically by humans or robotic devices. If a robot does this process, it is a must that the robot is able to explore the room autonomously. The robot movement in room tracking should reach all points without obstructions and return to its initial position. This study simulated the movement of a room explorer robot using the imperfect maze method, as well as searching a room that has not been explored using the A* algorithm. The A* algorithm was also used to find the shortest path to reach the initial place of the robot when the room exploration was completed. The results of the simulation showed that the imperfect maze could be used to explore the room well, and A* algorithm is quite optimal to be used for searching both the unexplored room and the path to return to its initial position

show abstract

Low-Cost Robot Path Planning Mechanism for Escaping from Dead Ends

Cao

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

FNUG: Imperfect Mazes Traversal Based on Detecting and Following the Nearest-to-Final-Goal and Unvisited Gaps

Cited by 6 publications

References 24 publications

Research on Multi-Beam Line Finding Problem and Optimal Line Finding Path based on Exhaustion Method

Research on Multi-Beam Line Finding Problem and Optimal Line Finding Path based on Exhaustion Method

Room cleaning robot movement using A* algorithm and imperfect maze

Low-Cost Robot Path Planning Mechanism for Escaping from Dead Ends

Contact Info

Product

Resources

About