Real-time heuristic search
From MaRDI portal
Publication:2639648
DOI10.1016/0004-3702(90)90054-4zbMath0718.68082OpenAlexW2021061679MaRDI QIDQ2639648
Publication date: 1990
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(90)90054-4
Learning and adaptive systems in artificial intelligence (68T05) Other game-theoretic models (91A40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (53)
Explicit sub-optimal linear quadratic regulation with state and input constraints ⋮ Deliberation scheduling for problem solving in time-constrained environments ⋮ A distributed ant algorithm for efficiently patrolling a network ⋮ Agent searching in a tree and the optimality of iterative deepening ⋮ Flexible hard real-time scheduling for deliberative AI systems ⋮ The statistics of state-spaces ⋮ TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks ⋮ Anytime search in dynamic graphs ⋮ Intelligent transportation systems -- Enabling technologies ⋮ Improving search efficiency using possible subgoals ⋮ Network languages for concurrent multiagent systems ⋮ The effect of representation and knowledge on goal-directed exploration with reinforcement-learning algorithms ⋮ Pragmatic navigation: reactivity, heuristics, and search ⋮ On a simple depth-first search strategy for exploring unknown graphs ⋮ Optimal composition of real-time systems ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Incorporating weights into real-time heuristic search ⋮ When is it better not to look ahead? ⋮ Abstraction and approximate decision-theoretic planning. ⋮ Properties of the DGS-auction algorithm ⋮ Static and expanding grid coverage with ant robots: complexity results ⋮ Inconsistent heuristics in theory and practice ⋮ Optimization of heuristic search using recursive algorithm selection and reinforcement learning ⋮ FMS scheduling based on timed Petri net model and reactive graph search ⋮ Agent search in uniform b-ary trees: Multiple goals and unequal costs ⋮ Limited lookahead in imperfect-information games ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Escaping depressions in LRTS based on incremental refinement of encoded quad-trees ⋮ Linear-space best-first search ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ Heuristic anytime approaches to stochastic decision processes ⋮ Iterative state-space reduction for flexible computation ⋮ Planning as heuristic search ⋮ LAO*: A heuristic search algorithm that finds solutions with loops ⋮ Minimax real-time heuristic search ⋮ Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms ⋮ Planning and control in artificial intelligence: A unifying perspective ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ Two-agent IDA* ⋮ A tutorial survey of reinforcement learning ⋮ A high-performance exact method for the resource-constrained project scheduling problem ⋮ Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search ⋮ Performance of linear-space search algorithms ⋮ Performance of linear-space search algorithms ⋮ CA Models for Target Searching Agents ⋮ Utility-based on-line exploration for repeated navigation in an embedded graph ⋮ Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems ⋮ Unifying single-agent and two-player search ⋮ Model-based Reinforcement Learning: A Survey ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning ⋮ Truncated incremental search ⋮ Qualitative simulation of temporal concurrent processes using time interval Petri nets ⋮ Controlling the learning process of real-time heuristic search
Cites Work
This page was built for publication: Real-time heuristic search
