The Optimality of Satisficing Solutions

03/27/2013
by   Othar Hansson, et al.
0

This paper addresses a prevailing assumption in single-agent heuristic search theory- that problem-solving algorithms should guarantee shortest-path solutions, which are typically called optimal. Optimality implies a metric for judging solution quality, where the optimal solution is the solution with the highest quality. When path-length is the metric, we will distinguish such solutions as p-optimal.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 2

page 3

page 4

page 5

page 6

page 7

page 8

page 9

10/19/2020

Evolutionary Algorithm and Multifactorial Evolutionary Algorithm on Clustered Shortest-Path Tree problem

In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-ha...
05/29/2018

Routing Metrics Depending on Previous Edges: The Mn Taxonomy and its Corresponding Solutions

The routing algorithms used by current operators aim at coping with the ...
07/04/2012

Theory and Techniques for Synthesizing a Family of Graph Algorithms

Although Breadth-First Search (BFS) has several advantages over Depth-Fi...
09/18/2020

Length-Bounded Paths Interdiction in Continuous Domain for Network Performance Assessment

Studying on networked systems, in which a communication between nodes is...
05/19/2021

Diversity in Kemeny Rank Aggregation: A Parameterized Approach

In its most traditional setting, the main concern of optimization theory...
06/09/2021

Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences

The paper addresses the problem of defining families of ordered sequence...
10/11/2021

AMRA*: Anytime Multi-Resolution Multi-Heuristic A*

Heuristic search-based motion planning algorithms typically discretise t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.