Search results

...tion description language]] and used as the input for [[automated planning|automated planners]]. ...cation of action models for planners is often a difficult, time consuming, and error-prone task (especially in complex environments). ...

...h as multi-[[robot]] [[motion planning]] (in which the pebbles are robots) and [[network routing]] (in which the pebbles are [[Data packet|packets]] of da ...on on Graphs problem is to decide, given two arrangements <math>S_0</math> and <math>S_+</math>, whether there is a sequence of moves that transforms <mat ...

...an identify when to use which algorithm, we can optimize for each scenario and improve overall performance. This is what algorithm selection aims to do. T ...\in \mathcal{P}</math>, a set of instances <math>i \in \mathcal{I}</math> and a cost metric <math>m: \mathcal{P} \times \mathcal{I} \to \mathbb{R}</math> ...

...path found by A* on an octile grid vs. the shortest path between the start and goal nodes.]] ...OCS15/paper/viewFile/11295/10658 An Empirical Comparison of Any-Angle Path-Planning Algorithms]. Proceedings of the Eighth International Symposium on Combinato ...

...ls. MAPF is the multi-agent generalization of the [[pathfinding]] problem, and it is closely related to the [[shortest path problem]] in the context of [[ ...t is important to reach a trade-off between the efficiency of the solution and its effectiveness. ...

...he path and with prescribed initial and terminal [[tangents]] to the path, and an assumption that the vehicle traveling the path can only travel forward. | title=Optimal paths for a car that goes both forwards and backwards ...

...rst2=Petter |year=2018 |arxiv=1709.00084 |title=Behavior Trees in Robotics and AI: An Introduction |publisher=CRC Press |doi=10.1201/9780429489105 |isbn=9 ...search and grasp.svg|thumb|right|450px| Behavior tree modelling the search and grasp plan of a two-armed robot]] ...

...=":3">{{citation|last=Mertens|first=Stephan|title=Computational complexity and statistical physics|page=125|year=2006|editor1=Allon Percus|chapter=The Eas * Minimize the difference between the largest sum and the smallest sum. This objective is common in papers about multiway number ...

...coverage/mcts-rome-ii/|archive-date=13 March 2017|url-status=dead}}</ref>) and applications outside of games.<ref name="beyondgames">{{cite journal |last1 ...d then with machine-generated evaluation functions for [[Reversi|Othello]] and [[chess]]. ...

...t (red) and target (blue), as 5-bit [[Word (computer architecture)|words]] and a 1 bit interrupt signal. Upper right: the model's output.]] ...Mind|website=DeepMind|date=12 October 2016 |access-date=2016-10-19}}</ref> and address big-data applications that require some sort of reasoning, such as ...

...elated fields, including terms relevant to [[software]], [[data science]], and {{gli|computer programming}}. ...lly in terms of possible values, possible operations on data of this type, and the behavior of these operations. This contrasts with {{gli|data structure| ...

...atz]] [[Berlin U-Bahn|U-Bahn]] station in Berlin is built with glass walls and doors, exposing the inner workings.]] ...ey are typically powered by [[electric motors]] that drive traction cables and [[counterweight]] systems such as a [[Hoist (device)|hoist]], although some ...