Path Search Task: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A Path Search Task is a search task that seeks a graph path in a graph. * <B>See:</B> Optimial-Path Search, Routing Problem, Cycle Search. ---- ----") |
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
||
| (9 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
A [[Path Search Task]] is a [[search task]] that seeks a [[graph path]] in a [[graph]]. | A [[Path Search Task]] is a [[search task]] that seeks a [[graph path]] in a [[graph]]. | ||
* <B> | * <B>Context:</B> | ||
** It can range from being a [[Directed Path Search Task]] to being an [[Undirected Path Search Task]]. | |||
** It can range from being a [[Simple Path Search Task]] to being a [[Multi-Point Path Search Task]]. | |||
** It can range from being a [[Single-Agent Path Search Task]] to being a [[Multi-Agent Path Search Task]]. | |||
* <B>Example(s):</B> | |||
** a [[Cycle Search Task]]. | |||
** an [[Optimal-Path Search]] (with a [[cost function]]). | |||
** … | |||
* <B>Counter-Example(s):</B> | |||
** a [[Packing Problem]]. | |||
* <B>See:</B> [[Web Search]]. | |||
---- | ---- | ||
---- | ---- | ||
__NOTOC__ | |||
[[Category:Concept]] | |||
Latest revision as of 04:59, 6 January 2023
A Path Search Task is a search task that seeks a graph path in a graph.
- Context:
- It can range from being a Directed Path Search Task to being an Undirected Path Search Task.
- It can range from being a Simple Path Search Task to being a Multi-Point Path Search Task.
- It can range from being a Single-Agent Path Search Task to being a Multi-Agent Path Search Task.
- Example(s):
- a Cycle Search Task.
- an Optimal-Path Search (with a cost function).
- …
- Counter-Example(s):
- See: Web Search.