default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelipe W. Trevizan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Dillon Ze Chen
, Sylvie Thiébaux, Felipe W. Trevizan:
Learning Domain-Independent Heuristics for Grounded and Lifted Planning. AAAI 2024: 20078-20086- [c24]Johannes Schmalz, Felipe W. Trevizan:
Efficient Constraint Generation for Stochastic Shortest Path Problems. AAAI 2024: 20247-20255 - [c23]Johannes Schmalz, Felipe W. Trevizan:
Finding Optimal Deterministic Policies for Constrained Stochastic Shortest Path Problems. ECAI 2024: 4148-4156 - [c22]Dillon Z. Chen, Felipe W. Trevizan, Sylvie Thiébaux:
Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning. ICAPS 2024: 68-76 - [c21]Mingyu Hao, Felipe W. Trevizan, Sylvie Thiébaux, Patrick Ferber, Jörg Hoffmann:
Guiding GBFS through Learned Pairwise Rankings. IJCAI 2024: 6724-6732 - [i8]Johannes Schmalz, Felipe W. Trevizan:
Efficient Constraint Generation for Stochastic Shortest Path Problems. CoRR abs/2401.14636 (2024) - [i7]Dillon Ze Chen, Felipe W. Trevizan, Sylvie Thiébaux:
Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning. CoRR abs/2403.16508 (2024) - 2023
- [c20]Dillon Ze Chen, Felipe W. Trevizan, Sylvie Thiébaux:
Heuristic Search for Multi-Objective Probabilistic Planning. AAAI 2023: 11945-11954 - [i6]Dillon Ze Chen, Felipe W. Trevizan, Sylvie Thiébaux:
Heuristic Search for Multi-Objective Probabilistic Planning. CoRR abs/2303.14363 (2023) - [i5]Dillon Ze Chen, Sylvie Thiébaux, Felipe W. Trevizan:
Learning Domain-Independent Heuristics for Grounded and Lifted Planning. CoRR abs/2312.11143 (2023) - 2022
- [c19]Florian Geißer, Patrik Haslum, Sylvie Thiébaux, Felipe W. Trevizan:
Admissible Heuristics for Multi-Objective Planning. ICAPS 2022: 100-109 - [c18]Patrick Ferber, Florian Geißer, Felipe W. Trevizan, Malte Helmert, Jörg Hoffmann:
Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods. ICAPS 2022: 583-587 - 2021
- [c17]Ian Mallett, Sylvie Thiébaux, Felipe W. Trevizan:
Progression Heuristics for Planning with Probabilistic LTL Constraints. AAAI 2021: 11870-11879 - 2020
- [j4]Sam Toyer, Sylvie Thiébaux, Felipe W. Trevizan, Lexing Xie:
ASNets: Deep Learning for Generalised Planning. J. Artif. Intell. Res. 68: 1-68 (2020) - [c16]Florian Geißer, Guillaume Povéda, Felipe W. Trevizan, Manon Bondouy, Florent Teichteil-Königsbuch, Sylvie Thiébaux:
Optimal and Heuristic Approaches for Constrained Flight Planning under Weather Uncertainty. ICAPS 2020: 384-393 - [c15]William Shen, Felipe W. Trevizan, Sylvie Thiébaux:
Learning Domain-Independent Planning Heuristics with Hypergraph Networks. ICAPS 2020: 574-584
2010 – 2019
- 2019
- [c14]William Shen, Felipe W. Trevizan, Sam Toyer, Sylvie Thiébaux, Lexing Xie:
Guiding Search with Generalized Policies for Probabilistic Planning. SOCS 2019: 97-105 - [i4]Sam Toyer, Felipe W. Trevizan, Sylvie Thiébaux, Lexing Xie:
ASNets: Deep Learning for Generalised Planning. CoRR abs/1908.01362 (2019) - [i3]William Shen, Felipe W. Trevizan, Sylvie Thiébaux:
Learning Domain-Independent Planning Heuristics with Hypergraph Networks. CoRR abs/1911.13101 (2019) - 2018
- [c13]Sam Toyer, Felipe W. Trevizan, Sylvie Thiébaux, Lexing Xie:
Action Schema Networks: Generalised Policies With Deep Learning. AAAI 2018: 6294-6301 - [c12]Felipe W. Trevizan, Sylvie Thiébaux, Patrik Haslum:
Operator Counting Heuristics for Probabilistic Planning. IJCAI 2018: 5384-5388 - [c11]Peter Baumgartner, Sylvie Thiébaux, Felipe W. Trevizan:
Heuristic Search Planning With Multi-Objective Probabilistic LTL Constraints. KR 2018: 415-424 - 2017
- [c10]Felipe W. Trevizan, Sylvie Thiébaux, Patrik Haslum:
Occupation Measure Heuristics for Probabilistic Planning. ICAPS 2017: 306-315 - [c9]Felipe W. Trevizan, Sylvie Thiébaux, Pedro Henrique Santana, Brian C. Williams:
I-dual: Solving Constrained SSPs via Heuristic Search in the Dual Space. IJCAI 2017: 4954-4958 - [c8]Peter Baumgartner, Sylvie Thiébaux, Felipe W. Trevizan:
Tableaux for Policy Synthesis for MDPs with PCTL* Constraints. TABLEAUX 2017: 175-192 - [c7]Felipe W. Trevizan, Florent Teichteil-Königsbuch, Sylvie Thiébaux:
Efficient solutions for Stochastic Shortest Path Problems with Dead Ends. UAI 2017 - [i2]Peter Baumgartner, Sylvie Thiébaux, Felipe W. Trevizan:
Tableaux for Policy Synthesis for MDPs with PCTL* Constraints. CoRR abs/1706.10102 (2017) - [i1]Sam Toyer, Felipe W. Trevizan, Sylvie Thiébaux, Lexing Xie:
Action Schema Networks: Generalised Policies with Deep Learning. CoRR abs/1709.04271 (2017) - 2016
- [c6]Felipe W. Trevizan, Sylvie Thiébaux, Pedro Henrique Santana, Brian Charles Williams:
Heuristic Search in Dual Space for Constrained Stochastic Shortest Path Problems. ICAPS 2016: 326-334 - 2015
- [j3]Felipe M. Santos, Leliane N. de Barros, Felipe W. Trevizan:
Reachability-based model reduction for Markov decision process. J. Braz. Comput. Soc. 21(1): 5:1-5:16 (2015) - 2014
- [j2]Felipe W. Trevizan, Manuela M. Veloso:
Depth-based short-sighted stochastic shortest path problems. Artif. Intell. 216: 179-205 (2014) - 2013
- [b1]Felipe W. Trevizan:
Short-Sighted Probabilistic Planning. Carnegie Mellon University, USA, 2013 - [c5]Felipe W. Trevizan, Manuela M. Veloso:
Finding objects through stochastic shortest path problems. AAMAS 2013: 547-554 - 2012
- [c4]Felipe W. Trevizan, Manuela M. Veloso:
Short-Sighted Stochastic Shortest Path Problems. ICAPS 2012 - [c3]Felipe W. Trevizan, Manuela M. Veloso:
Trajectory-Based Short-Sighted Probabilistic Planning. NIPS 2012: 3257-3265
2000 – 2009
- 2007
- [c2]Felipe W. Trevizan, Fábio Gagliardi Cozman, Leliane Nunes de Barros:
Planning under Risk and Knightian Uncertainty. IJCAI 2007: 2023-2028 - 2006
- [j1]Felipe W. Trevizan, Leliane Nunes de Barros, Flávio S. Corrêa da Silva:
Designing logic-based robots. Inteligencia Artif. 10(31): 11-22 (2006) - [c1]Felipe W. Trevizan, Fábio Gagliardi Cozman, Leliane Nunes de Barros:
Unifying Nondeterministic and Probabilistic Planning Through Imprecise Markov Decision Processes. IBERAMIA-SBIA 2006: 502-511
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
