Results 1  10
of
14,404
On Multicast Path Finding Algorithms
, 1991
"... We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuristic algorithm with the assumption that all vertices have the multicast capability, and a heuristic algorithm for network ..."
Abstract

Cited by 46 (2 self)
 Add to MetaCart
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuristic algorithm with the assumption that all vertices have the multicast capability, and a heuristic algorithm
Gridbased Pathfinding
, 2002
"... Pathfinding is an important problem for many applications, including network traffic, robot planning, military simulations, and computer games. Typically, a grid is superimposed over a region, and a graph search is used to find the optimal (minimal cost) path. The most common scenario is to use a g ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
Pathfinding is an important problem for many applications, including network traffic, robot planning, military simulations, and computer games. Typically, a grid is superimposed over a region, and a graph search is used to find the optimal (minimal cost) path. The most common scenario is to use a
Near optimal hierarchical pathfinding
 Journal of Game Development
, 2004
"... The problem of pathfinding in commercial computer games has to be solved in real time, often under constraints of limited memory and CPU resources. The computational effort required to find a path, using a search algorithm such as A*, increases with size of the search space. Hence, pathfinding on l ..."
Abstract

Cited by 90 (11 self)
 Add to MetaCart
The problem of pathfinding in commercial computer games has to be solved in real time, often under constraints of limited memory and CPU resources. The computational effort required to find a path, using a search algorithm such as A*, increases with size of the search space. Hence, pathfinding
Mode directed path finding
 In Lecture notes in computer science: Vol. 3720. Proceedings of the 16th European Conference on Machine Learning
, 2005
"... Abstract. Learning from multirelational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hillclimbing heuristics in learning firstorder concepts, have been a dominating force in the area of multirelational concept lea ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
learning. However, hillclimbing heuristics are susceptible to local maxima and plateaus. In this paper, we show how we can exploit the links between objects in multirelational data to help a firstorder rule learning system direct the search by explicitly traversing these links to find paths between
MULTICRITERIA PATH FINDING
"... Path finding solutions are becoming a major part of many GIS applications including location based services and webbased GIS services. Most traditional path finding solutions are based on shortest path algorithms that tend to minimize the cost of travel from one point to another. These algorithms m ..."
Abstract
 Add to MetaCart
Path finding solutions are becoming a major part of many GIS applications including location based services and webbased GIS services. Most traditional path finding solutions are based on shortest path algorithms that tend to minimize the cost of travel from one point to another. These algorithms
PathFinding in Networks
 Proc SEAR CC '90 South East Asia Regional Computer Confederation Conf
, 1994
"... Algorithms that find connections between concepts in semantic networks are inherently inefficient due to their dependence on piecemeal representation of potential paths. A method of reorganizing a linkbased network into a pathbased representation is argued to allow more efficient search techniques ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Algorithms that find connections between concepts in semantic networks are inherently inefficient due to their dependence on piecemeal representation of potential paths. A method of reorganizing a linkbased network into a pathbased representation is argued to allow more efficient search
Insect navigation and path finding
 Acta Futura
"... Insects have a brain weighing about a tenth of a milligram. Nevertheless some insect species exhibit amazing performance in finding their daily paths when looking for food or shelter. Some species have even found their ecological niche in being excellent navigators and hence can survive in extrem ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Insects have a brain weighing about a tenth of a milligram. Nevertheless some insect species exhibit amazing performance in finding their daily paths when looking for food or shelter. Some species have even found their ecological niche in being excellent navigators and hence can survive in ex
Heuristic Search Viewed as Path Finding in a Graph
 ARTIFICIAL INTELLIGENCE
, 1970
"... This paper presents a particular model of heuristic search as a pathfinding problem in a directed graph. A class of graphsearching procedures is described which uses a heuristic function to guide search. Heuristic functions are estimates of the number of edges that remain to be traversed in reachi ..."
Abstract

Cited by 109 (0 self)
 Add to MetaCart
This paper presents a particular model of heuristic search as a pathfinding problem in a directed graph. A class of graphsearching procedures is described which uses a heuristic function to guide search. Heuristic functions are estimates of the number of edges that remain to be traversed
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Path Finding for the Animation of Walking Characters
, 2005
"... Both path finding and character animation play an important role in virtual environments. In this paper we describe a new approach to plan the path for a single character, taking into account constraints put forth by the availability of the motion capture data. The final path of the character is gua ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Both path finding and character animation play an important role in virtual environments. In this paper we describe a new approach to plan the path for a single character, taking into account constraints put forth by the availability of the motion capture data. The final path of the character
Results 1  10
of
14,404