• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Partial Move A*

Cazenave, Tristan (2010), Partial Move A*, 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), 2010 - proceedings, IEEE, p. 25-31

View/Open
partial_move.PDF (123.9Kb)
Type
Communication / Conférence
Date
2010
Conference title
22th International Conference on Tools with Artificial Intelligence
Conference date
2010-10
Conference city
Arras
Conference country
France
Book title
22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), 2010 - proceedings
Publisher
IEEE
ISBN
978-1-4244-8817-9
Pages
25-31
Publication identifier
http://dx.doi.org/10.1109/ICTAI.2010.79
Metadata
Show full item record
Author(s)
Cazenave, Tristan
Abstract (EN)
Some shortest path problems that can be solved using the A* algorithm have a large branching factor due to the combination of multiple choices at each move. Multiple sequence alignment and multi-agent pathfinding are examples of such problems. If the search can be stopped after each choice instead of being stopped at each combination of choices, it takes much less memory and much less time. The goal of the paper is to show that Partial Move A* is much better than A* for these problems when the branching factor is large due to a large combination of choices at each move. When there is such a large combination of choices at each move, Partial Move A* can yield large memory gains and speedups over regular A*.
Subjects / Keywords
A*; Partial Move A*; shortest path problem

Related items

Showing items related by title and author.

  • Thumbnail
    Playout Policy Adaptation with Move Features 
    Cazenave, Tristan (2016) Article accepté pour publication ou publié
  • Thumbnail
    UCD : Upper confidence bound for rooted directed acyclic graphs 
    Cazenave, Tristan; Méhat, Jean; Saffidine, Abdallah (2012) Article accepté pour publication ou publié
  • Thumbnail
    Material Symmetry to Partition Endgame Tables 
    Buron, Cédric; Cazenave, Tristan; Jouandeau, Nicolas; Saffidine, Abdallah (2014) Communication / Conférence
  • Thumbnail
    Developments on Product Propagation 
    Cazenave, Tristan; Saffidine, Abdallah (2014) Communication / Conférence
  • Thumbnail
    Nested Monte Carlo Search for Two-Player Games 
    Cazenave, Tristan; Saffidine, Abdallah; Schofield, Michael John; Thielscher, Michael (2016) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo