Skip to search formSkip to main contentSkip to account menu

Goal node (computer science)

Known as: Goal node, Node 
In computer science, a goal node is a node in a graph that meets defined criteria for success or termination. Heuristical artificial intelligence… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Artificial intelligenceComputer scienceGraph (discrete mathematics)Node (computer science)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Characteristics of the Analytic Network Process, a Multi-Criteria Decision-Making Method
The Analytic Network Process (ANP) is one of the most complex multi-criteria decision-making methods. It was developed by… 
2016
2016
Wave Front Method Based Path Planning Algorithm for Mobile Robots
Path planning problem revolves around finding a path from start node to goal node without any collisions. This paper presents an… 
2013
2013
Semantic mapping and navigation: A Bayesian approach
We propose Bayesian approaches for semantic mapping, active localization and local navigation with affordable vision sensors. We… 
2011
2011
Utility-Value-Based Data Delivery Scheme for Opportunistic Network and Its Performance Study
This paper proposes a utility-value-based forwarding protocol (UVBFP), which uses the history information of the met between… 
2010
2010
An improved PSO for path planning of mobile robots and its parameters discussion
An improved path planning algorithm for mobile robot in known environment is presented in this paper. Firstly, the environment… 
2009
2009
Indoor navigation to support the blind person using weighted topological map
This paper introduces a new approach of an electronic cane for navigation through the environment, using only vision system to… 
2008
2008
An Novel Energy-Efficient Minimum Routing Algorithm (EEMR) in Wireless Sensor Networks
One of the key problems for wireless sensor networks (WSNs) is the design of energy-efficient routing algorithm, because sensor… 
Highly Cited
2008
Highly Cited
2008
Path and trajectory diversity: Theory and algorithms
We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain… 
1999
1999
A Divide and Conquer Bidirectional Search: First Results
We present a new algorithm to reduce the space complexity of heuristic search. It is most effective for problem spaces that grow… 
Review
1995
Review
1995
Parallel Processing of Discrete Optimization Problems
Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)