Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Many search algorithms have parameters that need to be tuned to get the best performance. Typically, the parameters are tuned offline, resulting in a generic setting that is supposed to be effective on all problem instances. For suboptimal single-agent search, problem-instance-specific parameter settings can result in substantially reduced search effort.  consider the use of dovetailing as a way to take advantage of this fact. Dovetailing is a procedure that performs search with multiple parameter settings simultaneously. Dovetailing is shown to improve the search speed of ighted IDA* by several orders of magnitude and to generally enhance the performance of ighted RBFS. This procedure is trivially parallelizable and is shown to be an effective form of parallelization for WA* and BULB. In particular, using WA* with parallel dovetailing yields good speedups in the sliding-tile puzzle domain, and increases the number of problems solved when used in an automated planning system.
['Richard Anthony Valenzano', 'Nathan R. Sturtevant', 'Jonathan Schaeffer', 'Karen Buro', 'Akihiro Kishimoto']
I am writing a research paper on a idea Simultaneously searching with multiple settings: an alternative to parameter tuning for suboptimal single-agent search algorithms
[{"from": "human", "value": "I am writing a research paper on a idea Simultaneously searching with multiple settings: an alternative to parameter tuning for suboptimal single-agent search algorithms"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Many search algorithms have parameters that need to be tuned to get the best performance. Typically, the parameters are tuned offline, resulting in a generic setting that is supposed to be effective on all problem instances. For suboptimal single-agent search, problem-instance-specific parameter settings can result in substantially reduced search effort.  consider the use of dovetailing as a way to take advantage of this fact. Dovetailing is a procedure that performs search with multiple parameter settings simultaneously. Dovetailing is shown to improve the search speed of ighted IDA* by several orders of magnitude and to generally enhance the performance of ighted RBFS. This procedure is trivially parallelizable and is shown to be an effective form of parallelization for WA* and BULB. In particular, using WA* with parallel dovetailing yields good speedups in the sliding-tile puzzle domain, and increases the number of problems solved when used in an automated planning system."}]