Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Time-Bounded A* is a real-time, single-agent, deterministic search algorithm that expands states of a graph in the same order as A* does, but that unlike A* interleaves search and action execution. Known to outperform state-of-the-art real-time search algorithms based on Korf's Learning Real-Time A* (LRTA*) in some benchmarks, it has not been studied in detail and is sometimes not considered as a "true" real-time search algorithm since it fails in non-reversible problems even it the goal is still reachable from the current state.   propose and study Time-Bounded Best-First Search (TB(BFS)) a straightforward generalization of the time-bounded approach to any best-first search algorithm. Furthermore,  propose Restarting Time-Bounded ighted A* (TBR (WA*)), an algorithm that deals more adequately with non-reversible search graphs, eliminating "backtracking moves" and incorporating search restarts and heuristic learning. In nonreversible problems  prove that TB(BFS) terminates and  deduce cost bounds for the solutions returned by Time-Bounded ighted A* (TB(WA*)), an instance of TB(BFS). Furthermore,  prove TBR (WA*), under reasonable conditions, terminates.  evaluate TB(WA) in both grid pathfinding and the 15-puzzle. In addition,  evaluate TBR (WA*) on the racetrack problem.  compare our algorithms to LSS-LRTWA*, a variant of LRTA* that can exploit lookahead search and a ighted heuristic. A general observation is that the performance of both TB(WA*) and TBR (WA*) improves as the ight parameter is increased. In addition, our time-bounded algorithms almost always outperform LSS-LRTWA* by a significant margin.
['Carlos Hernández', 'Jorge A. Baier', 'Roberto Asín']
I am writing a research paper on a idea Time-bounded best-first search for reversible and non-reversible search graphs
[{"from": "human", "value": "I am writing a research paper on a idea Time-bounded best-first search for reversible and non-reversible search graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Time-Bounded A* is a real-time, single-agent, deterministic search algorithm that expands states of a graph in the same order as A* does, but that unlike A* interleaves search and action execution. Known to outperform state-of-the-art real-time search algorithms based on Korf's Learning Real-Time A* (LRTA*) in some benchmarks, it has not been studied in detail and is sometimes not considered as a \"true\" real-time search algorithm since it fails in non-reversible problems even it the goal is still reachable from the current state.   propose and study Time-Bounded Best-First Search (TB(BFS)) a straightforward generalization of the time-bounded approach to any best-first search algorithm. Furthermore,  propose Restarting Time-Bounded ighted A* (TBR (WA*)), an algorithm that deals more adequately with non-reversible search graphs, eliminating \"backtracking moves\" and incorporating search restarts and heuristic learning. In nonreversible problems  prove that TB(BFS) terminates and  deduce cost bounds for the solutions returned by Time-Bounded ighted A* (TB(WA*)), an instance of TB(BFS). Furthermore,  prove TBR (WA*), under reasonable conditions, terminates.  evaluate TB(WA) in both grid pathfinding and the 15-puzzle. In addition,  evaluate TBR (WA*) on the racetrack problem.  compare our algorithms to LSS-LRTWA*, a variant of LRTA* that can exploit lookahead search and a ighted heuristic. A general observation is that the performance of both TB(WA*) and TBR (WA*) improves as the ight parameter is increased. In addition, our time-bounded algorithms almost always outperform LSS-LRTWA* by a significant margin."}]