The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The research in the field of the localization and navigation of mobile robot is becoming more and more significant. Among them, the local real-time path planning for robot autonomous navigation in complex environment is particularly important. However, the current local path planning algorithms are all planning the local path in the same plan-scope. Sometimes, this situation leads to a waste of time...
Various types of autonomous vehicles(AVs) are used widely in the field of military and civilian. Aiming at the difficulty of the real-time intelligent planning of the AVs in the dynamic and uncertain complex environment, a more generalized graphical model-based planning frame and algorithm is studied in this paper. To plan the waypoints for AVs in stochastic environment, a dynamic Bayesian network-based...
In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects being optimal w.r.t. an arbitrary linear weighting of the underlying criteria. The most prominent example query is to find a reasonable set of hotels which are cheap but close to the beach. In this paper, we propose an new approach...
The problem of path planning deserves a special mention in the field of robotics as it enables the intelligent systems used in autonomous robots to move the robot from one position to the other. Out of the various methods used for solving the problem of robot path planning, two of the common approaches include multi-neuron heuristic search (MNHS) algorithm and evolutionary algorithms (EA). The MNHS...
Recently, it has been suggested that BDD-based RePlanning A* (BDDRPA*), a BDD-based incremental version of A*, might be an efficient search method for solving path-planning problems in artificial intelligence. BDDRPA* combines ideas of BDD-based search and incremental search to repeatedly find shortest paths from a start vertex to a goal vertex while the topology of the graph changes. However, BDDRPA*...
Path planning is the art of deciding which route to take, based on and expressed in terms of the current internal representation of the terrain. Path finding also involves the execution of this theoretical route, by translating the plan from the internal representation in terms of physical movement in the environment. During combat, transfers of military units in the shortest period and with least...
Mobile robot navigation is one of the important domains in mobile robot technologiespsila research. This problem is divided into two categories of basic sub-problems: path planning and motion planning. In this paper we integrate the path planning and motion planning of a robot into a uniform framework, which is described by a hybrid system. Hybrid systems combine discrete and continuous behavior so...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.