23 papers · ranked by Valyu relevance
Xiangquan Tan, Linhui Han, Hao Gong, Qingwen Wu + 1 more
Complete coverage path planning requires that the mobile robot traverse all reachable positions in the environmental map. Aiming at the problems of local optimal path and high path coverage ratio in the complete coverage path planning of the traditional biologically inspired neural network algorithm, a complete…
Ana Šelek, Marija Seder, Mišel Brezak, Ivan Petrović + 1 more
'Andrey V. Savkin'] The complete coverage path planning is a process of finding a path which ensures that a mobile robot completely covers the entire environment while following the planned path. In this paper, we propose a complete coverage path planning algorithm that generates smooth complete coverage paths based on…
Tae-Won Kang, Jin-Gu Kang, Jin-Woo Jung, Andrzej Stateczny
This paper proposes a post-processing method called bidirectional interpolation method for sampling-based path planning algorithms, such as rapidly-exploring random tree (RRT). The proposed algorithm applies interpolation to the path generated by the sampling-based path planning algorithm. In this study, the proposed…
Asem Khattab
Path planning is an important component in any highly automated vehicle system. In this report, the general problem of path planning is considered first in partially known static environments where only static obstacles are present but the layout of the environment is changing as the agent acquires new information.…
F. Lingelbach
Probabilistic Cell Decomposition (PCD) is a probabilistic path planning method combining the concepts of approximate cell decomposition with probabilistic sampling. It has been shown that the use of lazy evaluation techniques and supervised sampling in important areas result in a high performance path planning method.…
Kai Olav Ellefsen, Herman Augusto Lepikson, Jan Albiez
An important open problem in robotic planning is the autonomous generation of 3D inspection paths – that is, planning the best path to move a robot along in order to inspect a target structure. We recently suggested a new method for planning paths allowing the inspection of complex 3D structures, given a triangular…
Aisha Muhammad, Mohammed A. H. Ali, Sherzod Turaev, Rawad Abdulghafor + 7 more
'Rawad Abdulghafor' 'Ibrahim Haruna Shanono' 'Zaid Alzaid' 'Abdulrahman Alruban' 'Rana Alabdan' 'Ashit Kumar Dutta' 'Sultan Almotairi' 'Gregor Klancar'] This paper aims to develop a new mobile robot path planning algorithm, called generalized laser simulator (GLS), for navigating autonomously mobile robots in the…
Hub Ali, Dawei Gong, Meng Wang, Xiaolin Dai
This approach has been derived mainly to improve quality and efficiency of global path planning for a mobile robot with unknown static obstacle avoidance features in grid-based environment. The quality of the global path in terms of smoothness, path consistency and safety can affect the autonomous behavior of a robot.…
Ankit Manerikar, Tamer Shamseldin, Ayman Habib
—Applications involving autonomous navigation and planning of mobile agents can benefit greatly by employing online Simultaneous Localization and Mapping (SLAM) techniques, however, their proper implementation still warrants an efficient amalgamation with any offline path planning method that may be used for the…
Jinyuan Liu, Minglei Fu, Wen‐An Zhang, Bo Chen + 2 more
'Uladzislau Sychou'] Abstract— The Dijkstra algorithm is a classic path planning method, which in a discrete graph space, can start from a specified source node and find the shortest path between the source node and all other nodes in the graph. However, to the best of our knowledge, there is no effective method that…
Yongliang Shi, Shucheng Huang, Mingxing Li, Wenling Li
Path planning is a core technology for mobile robots. However, existing state-of-the-art methods suffer from issues such as excessive path redundancy, too many turning points, and poor environmental adaptability. To address these challenges, this paper proposes a novel global and local fusion path-planning algorithm.…
Konstantin Yakovlev, Egor Baskin, Ivan Hramoin
Square grids are commonly used in robotics and game development as spatial models and well known in AI community heuristic search algorithms (such as A, JPS, Theta etc.) are widely used for path planning on grids. A lot of research is concentrated on finding the shortest (in geometrical sense) paths while in many…
David W. Arathorn
This paper proposes an explicit computational process which reproduces what are considered to be two essential experimentally observed hippocampus capabilities. These are path planning and determining the chain of ordered relationships which bind two concepts. These are both inverse problems. The paper presents…
Olena Doroshenko
Pathfinding in complex topographies poses a challenge with applications extending from urban planning to autonomous navigation. While numerous algorithms offer potential solutions, their comparative efficiency and reliability when confronted with nonlinear terrains remain to be systematically evaluated. This study…
Amany Azevedo Amin, Andrew Philippides, Paul Graham
Individually foraging ants use egocentric views as a dominant navigation strategy for learning and retracing routes. Evidence suggests that route retracing can be achieved by algorithms which use views as ‘visual compasses’, where individuals choose the heading that leads to the most familiar visual scene when compared…
Jonas Scherer, Anabel Kroehnert, Martin Egelhaaf, Norbert Boeddeker
Human navigation relies on combining body cues (vestibular and proprioceptive signals) with visual cues such as optic flow. The weighting and integration of these signals during the continuous tracking of walked distances and angles, known as path integration, remain poorly understood. Previous path integration studies…
Arjun Chandrasekhar, James A. R. Marshall, Cortnea Austin, Saket Navlakha + 1 more
Creating a routing backbone is a fundamental problem in both biology and engineering. The routing backbone of the trail networks of arboreal turtle ants (Cephalotes goniodontus) connects many nests and food sources using trail pheromone deposited by ants as they walk. Unlike species that forage on the ground, the trail…
Alexander Muryy, Andrew Glennerster
The way people choose routes through unfamiliar environments provides clues about the underlying representation they use. One way to test the nature of observers’ representation is to manipulate the structure of the scene as they move through it and measure which aspects of performance are significantly affected and…
Brandon Walker, Nathan Miller, Brett Yang, Dhatri V. L. Penna + 15 more
Rapid generation and evaluation of diverse synthesis pathways play a critical role in exploring a broader chemical space and identifying potent drug candidates. Drug discovery often relies on laborintensive manual processes for retro synthetic route finding, resulting in challenges related to scalability and…
Authors not listed
Computer-aided synthesis planning aims to identify viable synthetic routes from a target compound to readily available building blocks by iteratively decomposing molecules into smaller precursors. Self-play search algorithms, trained with simulated experience, reach state-of-the-art performance. However, these methods…
Authors not listed
Identifying synthesis routes from knowledge graphs poses challenges beyond retrosynthesis, including path–finding artifacts and data issues. We introduce “SynGPS”, a novel algorithm that overcomes these limitations by identifying viable routes even with common artifacts. SynGPS can resolve nonsensical cycles…
Authors not listed
Advances in computer-assisted synthesis planning (CASP) are revolutionising how new functional molecules in many chemistry-using industries are being developed. CASP tools allow to assemble and analyse prior knowledge of a specified chemical system (a molecule, a reaction, a synthesis route), to generate hypotheses on…
Chonghuan Zhang, Alexei Lapkin
Computer assisted synthesis planning (CASP) accelerates the development of organic synthesis routes of pharmaceuticals and industrial chemicals. CASP tools are generally developed on the rules or data of synthetic chemistry which include some enzymatic reactions. However, synthetic biology offers a new degree of…