Photo of Francesco Percassi
 

View Scopus Profile

Francesco Percassi

Dr

  • University of Huddersfield Queensgate Huddersfield HD1 3DH

    United Kingdom

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
20172021

Research activity per year

If you made any changes in Pure these will be visible here soon.

Personal profile

Google Scholar h-Index

2 Last checked 2 July 2020

Biography

I received my Ph.D. in July 2019 from the University of Brescia, Italy under the supervision of Alfonso Gerevini. After that I worked for a year as a research fellow in the same University collaborating with the planning research group. 

In July 2020 I joined the PARK research group at the University of Huddersfield, as a research fellow in areas of automated planning. 

Research Expertise and Interests

My main research interest concern Artificial Intelligence Planning. I am very interested in compilation between different planning formalism (e.g. PDDL3 or planning with preferences, conditional effects) with both theoretical and practical purposes. 

Fingerprint

Dive into the research topics where Francesco Percassi is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 6 Similar Profiles

Network

Recent external collaboration on country level. Dive into details by clicking on the dots or
  • 10 Citations
  • 2 h-Index
  • 8 Conference contribution

  • On Planning with Qualitative State-Trajectory Constraints in PDDL3 by Compiling them Away

    Bonassi, L., Gerevini, A. E., Percassi, F. & Scala, E., 16 Feb 2021, (Accepted/In press) Proceedings of the 31st International Conference on Automated Planning and Scheduling : ICAPS 2021. AAAI press, 5 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Translations from Discretised PDDL+ to Numeric Planning

    Percassi, F., Scala, E. & Vallati, M., 16 Feb 2021, (Accepted/In press) Proceedings of the 31st International Conference on Automated Planning and Scheduling: ICAPS 2021. AAAI press, 9 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Generating and Exploiting Cost Predictions in Heuristic State-Space Planning

    Percassi, F., Gerevini, A. E., Scala, E., Serina, I. & Vallati, M., 29 May 2020, Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling: (ICAPS 2020). Beck, J. C., Buffet, O., Hoffmann, J., Karpas, E. & Sohrabi, S. (eds.). AAAI press, Vol. 30. p. 569-573 5 p. (Proceedings International Conference on Automated Planning and Scheduling, ICAPS; vol. 30).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Citation (Scopus)

  • Best-First Width Search for Multi Agent Privacy-Preserving Planning

    Gerevini, A. E., Lipovetzky, N., Percassi, F., Saetti, A. & Serina, I., 6 Jul 2019, Proceedings of the 29th International Conference on Automated Planning and Scheduling: (ICAPS 2019). Benton, J., Lipovetzky, N., Onaindia, E., Smith, D. E. & Srivastava, S. (eds.). AAAI press, p. 163-171 9 p. (Proceedings International Conference on Automated Planning and Scheduling, ICAPS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    3 Citations (Scopus)

  • Novelty Messages Filtering for Multi Agent Privacy-Preserving Planning

    Gerevini, A. E., Lipovetzky, N., Peli, N., Percassi, F., Saetti, A. & Serina, I., 5 Jul 2019, Proceedings of the 12th International Symposium on Combinatorial Search: (SoCS 2019). Surynek, P. & Yeoh, W. (eds.). AAAI press, p. 79-87 9 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Citation (Scopus)
  • 3 Oral presentation
  • 1 Organising a conference, workshop, ...
  • 1 Conference Peer-review
If you made any changes in Pure these will be visible here soon.