Persistence search -- a new search strategy for the dynamic shortest path problem - Info and Reading Options
By Man-Tak Shing
"Persistence search -- a new search strategy for the dynamic shortest path problem" was published by Naval Postgraduate School in 1991 - Monterey, Calif, it has 35 pages and the language of the book is English.
“Persistence search -- a new search strategy for the dynamic shortest path problem” Metadata:
- Title: ➤ Persistence search -- a new search strategy for the dynamic shortest path problem
- Author: Man-Tak Shing
- Language: English
- Number of Pages: 35
- Publisher: Naval Postgraduate School
- Publish Date: 1991
- Publish Location: Monterey, Calif
“Persistence search -- a new search strategy for the dynamic shortest path problem” Subjects and Themes:
- Subjects: Searching
Edition Specifications:
- Pagination: 35 p. :
Edition Identifiers:
- The Open Library ID: OL25481052M - OL16856746W
AI-generated Review of “Persistence search -- a new search strategy for the dynamic shortest path problem”:
"Persistence search -- a new search strategy for the dynamic shortest path problem" Description:
The Open Library:
The research reported in this paper deals with the problem of searching through an unknown terrain by a physical agent such as a robot. The unknown terrain over which the agent will travel is represented by an undirected graph. The agent has no prior knowledge of the graph. It can only learn about its environment by physically roaming it. Given a starting location s, the agent tries to reach a target location t using the minimum amount of physical movement. This problem, which is a natural generalization of the classical shortest path problem, will be referred to as the dynamic shortest path problem. Most of the classical shortest path algorithms perform very poorly in the scenario of a physical agent traversing an initially unknown search space. They do not attempt to minimize the amount of physical movement required by the agent to reach the goal location. In order to overcome the failings of these search algorithms in dealing with searches of this particular nature, a new search strategy, called persistence search, is developed and presented in this paper.
Read “Persistence search -- a new search strategy for the dynamic shortest path problem”:
Read “Persistence search -- a new search strategy for the dynamic shortest path problem” by choosing from the options below.
Search for “Persistence search -- a new search strategy for the dynamic shortest path problem” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Persistence search -- a new search strategy for the dynamic shortest path problem" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “Persistence search -- a new search strategy for the dynamic shortest path problem” in Libraries Near You:
Read or borrow “Persistence search -- a new search strategy for the dynamic shortest path problem” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Persistence search -- a new search strategy for the dynamic shortest path problem” at a library near you.
Buy “Persistence search -- a new search strategy for the dynamic shortest path problem” online:
Shop for “Persistence search -- a new search strategy for the dynamic shortest path problem” on popular online marketplaces.
- Ebay: New and used books.