edoc

Browse by Basel Contributors ID

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | Refereed | No Grouping

Article

Seipp, Jendrik and Keller, Thomas and Helmert, Malte. (2020) Saturated Cost Partitioning for Optimal Classical Planning. Journal of Artificial Intelligence Research, 67. pp. 129-167.

Seipp, Jendrik and Helmert, Malte. (2018) Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning. Journal of Artificial Intelligence Research, 62. pp. 535-577.

Conference or Workshop Item

Torralba, Álvaro and Seipp, Jendrik and Sievers, Silvan. (2021) Automatic Instance Generation for Classical Planning. In: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 31. pp. 376-384.

Seipp, Jendrik and Keller, Thomas and Helmert, Malte. (2021) Saturated Post-hoc Optimization for Classical Planning. In: AAAI-21 Proceedings: Thirty-Fifth AAAI Conference on Artificial Intelligence, 35. PALO ALTO, CA, pp. 11947-11953.

Seipp, Jendrik. (2021) Online Saturated Cost Partitioning for Classical Planning. In: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 31. pp. 317-321.

Drexler, Dominik and Seipp, Jendrik and Speck, David. (2021) Subset-Saturated Transition Cost Partitioning. In: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 31. pp. 131-139.

Pommerening, Florian and Keller, Thomas and Halasi, Valentina and Seipp, Jendrik and Sievers, Silvan and Helmert, Malte. (2021) Dantzig-Wolfe Decomposition for Cost Partitioning. In: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 31. pp. 271-280.

Seipp, Jendrik and von Allmen, Samuel and Helmert, Malte. (2020) Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement. In: Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020), 30. pp. 244-248.

Röger, Gabriele and Helmert, Malte and Seipp, Jendrik and Sievers, Silvan. (2020) An Atom-Centric Perspective on Stubborn Sets. In: Proceedings of the 13th Annual Symposium on Combinatorial Search (SoCS 2020). pp. 57-65.

Torralba, Álvaro and Seipp, Jendrik and Sievers, Silvan. (2020) Automatic Configuration of Benchmark Sets for Classical Planning. In: HSDIP 2020: Proceedings of the 12th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP). pp. 58-66.

Seipp, Jendrik. (2020) Online Saturated Cost Partitioning for Classical Planning. In: HSDIP 2020: Proceedings of the 12th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP). pp. 16-22.

Seipp, Jendrik. (2019) Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019). pp. 5621-5627.

Seipp, Jendrik and Helmert, Malte. (2019) Subset-Saturated Cost Partitioning for Optimal Classical Planning. In: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019). pp. 391-400.

Seipp, Jendrik and Keller, Thomas and Helmert, Malte. (2017) Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017). pp. 3651-3657.

Seipp, Jendrik and Keller, Thomas and Helmert, Malte. (2017) A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. In: Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017).

Seipp, Jendrik. (2017) Better Orders for Saturated Cost Partitioning in Optimal Classical Planning. In: Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017).

Keller, Thomas and Pommerening, Florian and Seipp, Jendrik and Geißer, Florian and Mattmüller, Robert. (2016) State-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 4. Palo Alto, pp. 3161-3169.

Seipp, Jendrik and Pommerening, Florian and Röger, Gabriele and Helmert, Malte. (2016) Correlation Complexity of Classical Planning Domains. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 4. pp. 3242-3250.

Pommerening, Florian and Helmert, Malte and Röger, Gabriele and Seipp, Jendrik. (2015) From non-negative to general operator cost partitioning. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) : January 25 –30, 2015, Austin, Texas, USA. Palo Alto, Calif., pp. 3335-3341.

Seipp, Jendrik and Sievers, Silvan and Helmert, Malte and Hutter, Frank. (2015) Automatic configuration of sequential planning portfolios. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) : January 25 –30, 2015, Austin, Texas, USA. Palo Alto, Calif., pp. 3364-3370.

Seipp, Jendrik and Pommerening, Florian and Helmert, Malte. (2015) New Optimization Functions for Potential Heuristics. In: Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). Palo Alto, California, pp. 193-201.

Seipp, Jendrik and Helmert, Malte. (2014) Diverse and additive Cartesian abstraction heuristics. In: Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014): [held on June 21-26 in Portsmouth, New Hampshire, USA]. Palo Alto, Calif., pp. 289-297.

Seipp, Jendrik and Helmert, Malte. (2013) Counterexample-guided Cartesian abstraction refinement. In: Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013) : [held 10 - 14 June 2013 in Rome, Italy]. Palo Alto, Calif., pp. 347-351.

Seipp, Jendrik and Helmert, Malte. (2013) Additive counterexample-guided Cartesian abstraction refinement. In: Late-breaking developments in the field of artificial intelligence : papers presented at the Twenty-Seventh AAAI Conference on Artificial Intelligence, [in Bellevue, WA, July 14 - 18, 2013] (AAAI 2013). Palo Alto, Calif., pp. 119-121.

Thesis

Seipp, Jendrik. Counterexample-guided cartesian abstraction refinement and saturated cost partitioning for optimal classical planning. 2018, Doctoral Thesis, University of Basel, Faculty of Science.

Other

Ferber, Patrick and Seipp, Jendrik. (2020) Explainable Planner Selection. In Proceedings of the International Workshop of Explainable AI Planning (XAIP).

Seipp, Jendrik. (2019) Planner Metrics Should Satisfy Independence of Irrelevant Alternatives (position paper). 2019 Workshop on the International Planning Competition (WIPC). pp. 40-41.

Seipp, Jendrik. (2018) Fast Downward Remix (planner abstract). Ninth International Planning Competition (IPC 2018).

Seipp, Jendrik. (2018) Scorpion (planner abstract). Ninth International Planning Competition (IPC 2018).

Seipp, Jendrik and Röger, Gabriele. (2018) Fast Downward Stone Soup 2018 (planner abstract). Ninth International Planning Competition (IPC 2018).

Pommerening, Florian and Seipp, Jendrik. (2016) Fast Downward Dead-End Pattern Database (planner abstract). First Unsolvability International Planning Competition (UIPC 2016).

Seipp, Jendrik and Pommerening, Florian and Sievers, Silvan and Wehrle, Martin and Fawcett, Chris and Alkhazraji, Yusra. (2016) Fast Downward Aidos (planner abstract). First Unsolvability International Planning Competition (UIPC 2016).

Seipp, Jendrik and Sievers, Silvan and Hutter, Frank. (2014) Fast Downward SMAC (IPC-learning planner abstract).

Seipp, Jendrik and Sievers, Silvan and Hutter, Frank. (2014) Fast Downward Cedalion (IPC planner abstract).

Seipp, Jendrik and Braun, Manuel and Garimort, Johannes. (2014) Fast Downward Uniform Portfolio (IPC planner abstract).

Röger, Gabriele and Pommerening, Florian and Seipp, Jendrik. (2014) Fast Downward Stone Soup 2014. Eighth International Planning Competition (IPC 2014), Deterministic Part.