Abstract Aiming at the problems of large memory consumption, long operation time and low security traditional A * algorithm, a dynamic adaptive improved algorithm based on is proposed. Firstly, according to heuristic function proportion obstacles in map, weighting carried out shorten search time. Secondly, jump point (JPS) integrated remove number redundant points improve running speed algorith...

Given σ units of data and a digraph G = (V,E) whose edges have delays, bandwidth constraints, and are labeled by terminals from a CFG (context-free grammar) G. A path p adheres to G’s path constraints iff the concatenation of all terminals along p forms a word of the language generated by G. The all-pairs quickest CFG labeled-path distance problem is: for all pairs of vertices, find the minimum...

This paper deals with the problem of multi-robot path planning based on learning classifier system in a dynamic narrow environment, where the workspace is cluttered with unpredictably moving objects. A Learning Classifier System is an accuracy-based machine learning system with gradient descent that combines reinforcement learning and rule discovery system. The genetic algorithm and the coverin...

This paper presents a novel technique for optimizing the efficiency of route discovery. The optimization aims to minimize the number of cached route request (RREQ), which is a significant source of overhead for the dynamic source routing (DSR) protocol. Our proposed technique is based on a decision algorithm that weighs individual links as a path to the necessary destination is being constructe...

the problem of navigation among movable obstacles (namo) is to find a collision free path for a robot while the robot is able to manipulate and transfer some objects (if possible or needed) to clear its path toward the goal. namo is a np-complete problem and is in a class of motion planning problems that have dynamic environments. in this domain, an optimal plan for the robot can be defined wit...