Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2006.01011
Cited By
v1
v2 (latest)
Computing Plan-Length Bounds Using Lengths of Longest Paths
Symposium on Combinatorial Search (SoCS), 2020
1 June 2020
Mohammad Abdulaziz
Dominik Berger
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Computing Plan-Length Bounds Using Lengths of Longest Paths"
2 / 2 papers shown
Actions You Can Handle: Dependent Types for AI Plans
Alasdair Hill
Ekaterina Komendantskaya
M. Daggitt
Ronald P. A. Petrick
94
0
0
24 May 2021
Cost Optimal Planning as Satisfiability
Mohammad Abdulaziz
106
2
0
03 Mar 2021
1
Page 1 of 1