Algorithms for Planning as State-Space Search
Stackelberg Planning: Towards Effective Leader-Follower State Space Search
... Stackelberg planning, where a leader player in a clas- sical planning task chooses a minimum-cost action sequence aimed at maximizing the plan cost of a follower player in the same ...Stackelberg ...
8
Online Planning Algorithms for POMDPs
... exhaustive search over all fringe ...online algorithms is the amount of time available during the execution for ...online planning time, the greater the importance of having a good offline value ...
42
Search algorithms for planning
... • optimality: when a goal node is visited, if any other possible path to that node has higher cost the path that led to that node is returned Given a state and the path followed to get there, the next node to ...
111
Partial-Order Planning Algorithms
... We can see the threat by noticing that Go(SM) has not At(Home) as an effect (because x1 is bound to Home), and that there are no ordering constraints to keep it from happening after st[r] ...
83
Algorithms for VLSI design planning
... We divide the whole die into bins based on signal bumps. Each bin has a certain amount of area for accommodating I/O buffers, based on the dead space.. or other pre-planned free space in[r] ...
119
Engineering Route Planning Algorithms
... Highway Hierarchies (HHs) [58,59] group nodes and edges in a hierarchy of levels by alternating between two procedures: Contraction (i.e., node reduction) removes low degree nodes by bypassing them with newly introduced ...
23
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
... approaches—heuristic state search and Graphplan planning— can be harnessed together to synthesize a family of planners that are more powerful than either of the base approaches ...of state ...
51
An assembly sequence planning approach with a multi state gravitational search algorithm
... in algorithms inspired by Newton’s Law of Universal Gravitation, which states that all objects attract each other with a force of gravitational ...gravitational search algorithm (BGSA) to allow the GSA to ...
7
Large scale parallel state space search utilizing graphics processing units and solid state disks
... solid state drives and graphics processing units is Explicit State Model Checking (Clarke et ...storage space and computation power increased dramatically with the introduction of parallel ...
232
Planning as heuristic search
... heuristic search planners that are based on a simple and general heuristic that assumes that action preconditions are ...hill-climbing search algorithms, and is tested over a large collection of ...
29
Local Search Algorithms for Portfolio Selection: Search Space and Correlation Analysis
... When solving an optimisation problem, a sound modelling and development phase should be based on the separation between the model and the algorithm: this stems from constraint programming, and several tools foster this ...
19
Complexity and search space reduction in cyclic-by-row PEVD algorithms
... several algorithms for the iterative calculation of a polynomial matrix eigenvalue decomposition (PEVD) have been ...the search and rotation stages, and do not significantly impact on algorithm ...
5
CiteSeerX — Planning graph heuristics for belief space search
... FF search engine as well as a cheap to compute relaxed plan ...belief state, the initial belief state, and the action ...belief state, reasoning about the belief state requires ...
65
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
... chaining search or bidirectional search and more generally undirectional ...bidirectional search which could co- operate through valid and invalid ...Also, planning with ressource will be a ...
7
Search Algorithms
... Diego State University as a way to search the various web servers on the campus network The ht://Dig system is a complete world wide web indexing and searching system for a domain or ...the search ...
9
Quantum search algorithms
... lattice search and Grover’s algorithm The search algorithm on the lattice introduced in chapter 4 possesses some interesting features which will be discussed in this ...the search algorithm is ...
153
Informed search algorithms
... • Like best-first except that it uses “total length (cost)” of a path instead of a heuristic value for the state.. • Each link has a “length” or “cost” (which is always greater than 0)[r] ...
32
Estimation Algorithms for Non-Gaussian State-Space Models with Application to Positioning
... initial state is given, IMS can typically estimate the user’s path accurately only over a short period because the biased error accumulates over ...time-series algorithms, WLAN positioning and PDR can be ...
175
Family of state space least mean power of two based algorithms
... of state space adaptive algorithms is ...of algorithms is derived based on stochastic gradient approach with a generalized least mean cost function J[ k] = E ε [ k] 2L for any integer ...
16
Particle MCMC algorithms and architectures for accelerating inference in state-space models.
... in State-Space Models (SSMs), a class of probabilistic models used in numerous scientific ...than state-of-the-art, parallel CPU and GPU implementations of pMCMC and up to 53x more energy efficient; the ...
21