Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning

Heuristic search is a powerful approach for solving planning problems and numeric planning is no exception. In this paper, we boost the performance of heuristic search for numeric planning with various powerful techniques orthogonal to improving heuristic informedness: numeric novelty heuristics, th...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the International Symposium on Combinatorial Search Vol. 17; pp. 203 - 207
Main Authors Chen, Dillon Z., Thiébaux, Sylvie
Format Journal Article Conference Proceeding
LanguageEnglish
Published 01.06.2024
Online AccessGet full text
ISSN2832-9171
2832-9163
2832-9163
DOI10.1609/socs.v17i1.31559

Cover

Abstract Heuristic search is a powerful approach for solving planning problems and numeric planning is no exception. In this paper, we boost the performance of heuristic search for numeric planning with various powerful techniques orthogonal to improving heuristic informedness: numeric novelty heuristics, the Manhattan distance heuristic, and exploring the use of multi-queue search and portfolios for combining heuristics.
AbstractList Heuristic search is a powerful approach for solving planning problems and numeric planning is no exception. In this paper, we boost the performance of heuristic search for numeric planning with various powerful techniques orthogonal to improving heuristic informedness: numeric novelty heuristics, the Manhattan distance heuristic, and exploring the use of multi-queue search and portfolios for combining heuristics.
Author Chen, Dillon Z.
Thiébaux, Sylvie
Author_xml – sequence: 1
  givenname: Dillon Z.
  surname: Chen
  fullname: Chen, Dillon Z.
– sequence: 2
  givenname: Sylvie
  surname: Thiébaux
  fullname: Thiébaux, Sylvie
BookMark eNqFkL1OwzAYRS1UJErpzugHaIo_u7HjEVVAEaUUAXPkODZYcuPKTory9vQHsTLdu5yrq3OJBk1oDELXQKbAibxJQafpDoSDKYM8l2doSAtGMwmcDf66gAs0TslVJCeCCULEED2tws74tscL00WXWqfTBD93vnXZa2c6g9-MivprglVT43WIrQ3ehYRtiHjVbUx0Gq-9ahrXfF6hc6t8MuPfHKGP-7v3-SJbvjw8zm-XmYZCyIwXRZ1bLbgp6sIamHGqJK9kbqHSBJSmupKsopxwQbnlnEKtKDNk_1uIGWMjBKfdrtmq_lt5X26j26jYl0DKg5DyIKQ8CimPQvYMOTE6hpSisf8jP0PGZwA
ContentType Journal Article
Conference Proceeding
DBID AAYXX
CITATION
ADTOC
UNPAY
DOI 10.1609/socs.v17i1.31559
DatabaseName CrossRef
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
EISSN 2832-9163
EndPage 207
ExternalDocumentID 10.1609/socs.v17i1.31559
10_1609_socs_v17i1_31559
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
M~E
ADTOC
UNPAY
ID FETCH-LOGICAL-c1879-688d5fc76e8d8fe1462a96b95f1bc01ac2cb93b2606726f6621da23e0b0577433
IEDL.DBID UNPAY
ISSN 2832-9171
2832-9163
IngestDate Sun Oct 26 04:06:55 EDT 2025
Tue Jul 01 04:10:44 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1879-688d5fc76e8d8fe1462a96b95f1bc01ac2cb93b2606726f6621da23e0b0577433
OpenAccessLink https://proxy.k.utb.cz/login?url=https://doi.org/10.1609/socs.v17i1.31559
PageCount 5
ParticipantIDs unpaywall_primary_10_1609_socs_v17i1_31559
crossref_primary_10_1609_socs_v17i1_31559
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2024-06-01
PublicationDateYYYYMMDD 2024-06-01
PublicationDate_xml – month: 06
  year: 2024
  text: 2024-06-01
  day: 01
PublicationDecade 2020
PublicationTitle Proceedings of the International Symposium on Combinatorial Search
PublicationYear 2024
SSID ssib050737007
Score 1.939075
Snippet Heuristic search is a powerful approach for solving planning problems and numeric planning is no exception. In this paper, we boost the performance of...
SourceID unpaywall
crossref
SourceType Open Access Repository
Index Database
StartPage 203
Title Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning
URI https://doi.org/10.1609/socs.v17i1.31559
UnpaywallVersion publishedVersion
Volume 17
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center)
  customDbUrl:
  eissn: 2832-9163
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssib050737007
  issn: 2832-9163
  databaseCode: M~E
  dateStart: 0
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5se9CTihXro-zBi9LUbB6b5CjSUpSGChbqKexudqFYkmKTSj34251N0vpAUG85LGH5Mpv5ZmfmG4TOPRH7sU-J4cYQ6ThSMYMLxzQE8QUHA-AO0_cdw5AOxs7txJ1U9x26F-Zz_p6awRVscdFdEm9KILoE9ltDDeoC666jxjgcXT_q2XFglHBmi6Fp1bNHqozkT6_44oG282TOVi9sNvvkVvq7pcbRolAj1NUkT908413x-k2r8S873kPNj-Y9PNq4pX20JZMDdBemSznLVngg80qbuYOL5lvjPpe5xGXZcQezJMa6ulSls2m6wEBpcZgXWR28nm_URON-7-FmYFRzFDTiXmBQ349dJTwq4bMoCf9GiwWUB64iXJiECUvwwOYQ2VDPoopSi8TMsqXJgcwBw7APUT1JE3mEsB34gTJtxa2AOY4rGTWVAkpgEkE8iMtb6GKNbTQv5TIiHWYAMJEGJiqAiQpgWuhyA_6vi4__s_gE7VjAPcqKrlNUz55zeQbcIeNtVBu-9dqV8bwDdnXA3g
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA66HfSk4sT5ixy8KOts-iNtjiKOoVgmOJinkqQJDEc7XDuZf70vbTenCOqth1DC15e-7-W99z2EzgOZhElIieUnEOl4SnNLSM-2JAmlAAMQHjf3HQ8R7Q-9u5E_qu87TC_Mev6e2uwKtjjrzkkwJhBdAvvdRE3qA-tuoOYwGlw_m9lxYJRwZsuhafVzQOqM5E-v-OKBtop0yhdvfDJZcyu9nUrjaFaqEZpqkpdukYuufP-m1fiXHe-i1mfzHh6s3NIe2lDpPrqPsrma5AvcV0WtzdzBZfOt9VioQuGq7LiDeZpgU12qs8k4m2GgtDgqyqwOXs43aqFh7_bppm_VcxQM4gGzaBgmvpYBVfBZtIJ_o8MZFczXREibcOlIwVwBkQ0NHKopdUjCHVfZAsgcMAz3ADXSLFWHCLssZNp2tXAY9zxfcWprDZTAJpIEEJe30cUS23hayWXEJswAYGIDTFwCE5fAtNHlCvxfFx_9Z_Ex2naAe1QVXSeokb8W6hS4Qy7OarP5APXMv60
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Novelty+Heuristics%2C+Multi-Queue+Search%2C+and+Portfolios+for+Numeric+Planning&rft.jtitle=Proceedings+of+the+International+Symposium+on+Combinatorial+Search&rft.au=Chen%2C+Dillon+Z.&rft.au=Thi%C3%A9baux%2C+Sylvie&rft.date=2024-06-01&rft.issn=2832-9171&rft.eissn=2832-9163&rft.volume=17&rft.spage=203&rft.epage=207&rft_id=info:doi/10.1609%2Fsocs.v17i1.31559&rft.externalDBID=n%2Fa&rft.externalDocID=10_1609_socs_v17i1_31559
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2832-9171&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2832-9171&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2832-9171&client=summon