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.
Aiming at the lack of stability and slow convergence of rapidly random-exploring trees (RRT) algorithm, an improved RRT path planning algorithm is proposed. Firstly, based on bidirectional search path planning algorithm, an improved combination strategy is proposed. The combination strategy combines target point search strategy with random search strategy, which not only improve the efficiency of...
One of the most popular algorithms in the field of domain independent planning is POP - partial order planning. POP considers a least commitment strategy to solve planning problems. Such strategy delays commitments during the planning phase until it is absolutely necessary. In consequence, the algorithm provides greater flexibility for solving planning problems, but with a higher cost in performance...
A new category of faster and efficiently planners has been used to solve planning problems, which use heuristic search algorithms to build their plans. One of the first successful planning systems to use this new approach was the Fast Forward (FF) planner, in which many other recent planners have built upon. FF proposed a heuristic function for planning problems and created a strategy that combines...
With the number of available Web services is rapidly increasing, how to compose multiple Web services automatically to fulfill a given request has attracted much attention. This paper proposes a dedicated planner named AWSP (Automatic Web Service Planner) toward this problem. Compared with other AI planners for automatic Web service composition, AWSP is characterized by its two different heuristic...
This paper focuses on route planning, especially for unmanned aircrafts in marine environment. Firstly, new heuristic information is adopted such as threat-zone, turn maneuver and forbid-zone based on voyage heuristic information. Then, the cost function is normalized to obtain more flexible and reasonable routes. Finally, an improved sparse A* search algorithm is employed to enhance the planning...
Real-time search is a standard approach to solving search problems in which agents have limited sensing capabilities and must act quickly. It is well known that real-time search algorithms like LRTA* and RTA* perform poorly in regions of the search space in which the heuristic function is very imprecise. Approaches that use look ahead or learning are used to overcome this drawback. They perform more...
Routing algorithm mainly focuses on routing method to ensure the connection between the sender and the receiver during each session is optimal and effective. It is very useful in packet transmission, especially in meeting the quality of service. Some traditional shortest path search algorithm (Width preferred search algorithm, Dijkstra algorithm) can solve the shortest path problem well within polynomial...
Location-routing problem (LRP) is a combinational optimization problem in a logistics system. Most heuristic methods employed for LRP is dividing the problem into location assignment and vehicle routing with a two-phase method, but this method often does not lead to a satisfactory result for the information can not be compressed from one phase to the other efficiently. In this paper we are concerned...
A 3D vehicle path planning method based on heuristic A* algorithm is proposed and simulated which makes the UAV's path planning for low altitude penetration more real-time, effective and engineering-oriented. The digital terrain information is processed with the integrated terrain elevation smoothing algorithm at first, and then, the safe flight surface which integrates the maneuverability of vehicle...
Automated storage and retrieval system (ASRS) is an important element of modern logistics system. In this paper, based on the analysis of input output operation of ASRS, a hybrid tabu search (HTS) algorithm is put forward to solve the problem of storage assignment. First, a heuristic algorithm is developed to generate the initial solution of storage assignment and then a tabu search algorithm is designed...
The resource mean square deviation of network planning is selected to measure the balance of resource. By setting the mean square deviation of resources to objective functions, and by the 2-norm is being introduced into the objective space, a function used for evaluating the balance optimization of multi-resource network planning is established, so the issue of multi-objective optimization is transferred...
Walksat-like algorithms are considered among the most powerful local search methods to solve the satisfiability problem. Such algorithms introduce a diversification mechanism based on a random walk strategy. This one is controlled by a noise parameter for which the optimal value setting is strongly dependent on the treated instance. In this paper, we propose to extend a previous work in order to reduce...
We have developed an effective heuristic algorithm based on a soft optimization approach for solving the multilevel lot-sizing problems in a series assembly product structure [Kaku et al., 2006 and 2008]. The heuristic algorithm segments the solution space and points the search direction in which a better solution may exist, by using the structure information of the multilevel lot-sizing problem,...
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.