Pascal Bercher

About Pascal Bercher

Pascal Bercher, With an exceptional h-index of 25 and a recent h-index of 20 (since 2020), a distinguished researcher at Australian National University, specializes in the field of Artificial Intelligence, Automated Planning, Complexity Theory, Heuristic Search, Human-Computer-Interaction.

His recent articles reflect a diverse array of research interests and contributions to the field:

On the Computational Complexity of Plan Verification,(Bounded) Plan-Optimality Verification, and Bounded Plan Existence

Towards Intelligent Companion Systems in General Aviation using Hierarchical Plan and Goal Recognition

Detecting AI Planning Modelling Mistakes–Potential Errors and Benchmark Domains

Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning

A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements

Can they come together? a computational complexity analysis of conjunctive possible effects of compound HTN planning tasks

Was fixing this Really that hard? On the complexity of correcting HTN domains

Towards automated modeling assistance: An efficient approach for repairing flawed planning domains

Pascal Bercher Information

University

Position

The Australia

Citations(all)

1991

Citations(since 2020)

1377

Cited By

1123

hIndex(all)

25

hIndex(since 2020)

20

i10Index(all)

49

i10Index(since 2020)

40

Email

University Profile Page

Google Scholar

Pascal Bercher Skills & Research Interests

Artificial Intelligence

Automated Planning

Complexity Theory

Heuristic Search

Human-Computer-Interaction

Top articles of Pascal Bercher

On the Computational Complexity of Plan Verification,(Bounded) Plan-Optimality Verification, and Bounded Plan Existence

Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024)

2024

Malte Helmert
Malte Helmert

H-Index: 31

Pascal Bercher
Pascal Bercher

H-Index: 19

Towards Intelligent Companion Systems in General Aviation using Hierarchical Plan and Goal Recognition

2023/12/4

Pascal Bercher
Pascal Bercher

H-Index: 19

Jane Jean Kiam
Jane Jean Kiam

H-Index: 5

Detecting AI Planning Modelling Mistakes–Potential Errors and Benchmark Domains

2023/11/10

Pascal Bercher
Pascal Bercher

H-Index: 19

Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning

2023/10

Gregor Behnke
Gregor Behnke

H-Index: 16

Pascal Bercher
Pascal Bercher

H-Index: 19

A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements

Proceedings of the International Symposium on Combinatorial Search

2023/7/2

Pascal Bercher
Pascal Bercher

H-Index: 19

Can they come together? a computational complexity analysis of conjunctive possible effects of compound HTN planning tasks

Proceedings of the International Conference on Automated Planning and Scheduling

2023/7/1

Pascal Bercher
Pascal Bercher

H-Index: 19

Was fixing this Really that hard? On the complexity of correcting HTN domains

Proceedings of the AAAI Conference on Artificial Intelligence

2023/6/26

Pascal Bercher
Pascal Bercher

H-Index: 19

Towards automated modeling assistance: An efficient approach for repairing flawed planning domains

Proceedings of the AAAI Conference on Artificial Intelligence

2023/6/26

Alban Grastien
Alban Grastien

H-Index: 12

Pascal Bercher
Pascal Bercher

H-Index: 19

On total-order HTN plan verification with method preconditions–an extension of the CYK parsing algorithm

Proceedings of the AAAI Conference on Artificial Intelligence

2023/6/26

Gregor Behnke
Gregor Behnke

H-Index: 16

Pascal Bercher
Pascal Bercher

H-Index: 19

Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans

The International FLAIRS Conference Proceedings

2023/5/8

Pascal Bercher
Pascal Bercher

H-Index: 19

Gregor Behnke
Gregor Behnke

H-Index: 16

The PANDADealer System for Totally Ordered HTN Planning in the 2023 IPC

sat

2023

Daniel Höller
Daniel Höller

H-Index: 16

Pascal Bercher
Pascal Bercher

H-Index: 19

On the Impact of Grounding on HTN Plan Verification via Parsing.

2023

Pascal Bercher
Pascal Bercher

H-Index: 19

Gregor Behnke
Gregor Behnke

H-Index: 16

Hierarchical planning and reasoning about partially ordered plans—From theory to practice

AI Magazine

2022/12/8

Pascal Bercher
Pascal Bercher

H-Index: 19

Finding Solution Preserving Linearizations For Partially Ordered Hierarchical Planning Problems

33rd PuK Workshop “Planen, Scheduling und Konfigurieren, Entwerfen”, PuK

2022/9/19

Gregor Behnke
Gregor Behnke

H-Index: 16

Pascal Bercher
Pascal Bercher

H-Index: 19

Planning Domain Repair as a Diagnosis Problem

2022/9/14

Alban Grastien
Alban Grastien

H-Index: 12

Pascal Bercher
Pascal Bercher

H-Index: 19

Making translations to classical planning competitive with other HTN planners

Proceedings of the AAAI Conference on Artificial Intelligence

2022/6/28

On the expressive power of planning formalisms in conjunction with LTL

Proceedings of the International Conference on Automated Planning and Scheduling

2022/6/13

Pascal Bercher
Pascal Bercher

H-Index: 19

Flexible fond htn planning: a complexity analysis

Proceedings of the International Conference on Automated Planning and Scheduling

2022/6/13

Pascal Bercher
Pascal Bercher

H-Index: 19

Compiling HTN plan verification problems into HTN planning problems

Proceedings of the International Conference on Automated Planning and Scheduling

2022/6/13

On heuristics for parsing-based verification of hierarchical plans with a goal task

The International FLAIRS Conference Proceedings

2022/5/4

Pascal Bercher
Pascal Bercher

H-Index: 19

Gregor Behnke
Gregor Behnke

H-Index: 16

See List of Professors in Pascal Bercher University(Australian National University)

Co-Authors

academic-engine