Skip to main content
Photo of Luigi Bonassi

Luigi Bonassi

Postdoctoral Researcher - GOALS

Postdoctoral Research Assistant in AI for Robot Decision-Making

Luigi is a Postdoctoral Research Assistant in AI for Robot Decision-Making at the Oxford Robotics Institute (ORI).

His doctoral research focused on the field of AI called Automated Planning, which addresses the problem of deciding what to do to satisfy a set of goals. Specifically, He developed effective approaches for handling non-Markovian specifications on how goals are achieved.

Before joining the ORI, Luigi earned a Ph.D. in Information Engineering from the University of Brescia, where he also completed his Bachelor's and Master's degrees in Computer Science and Engineering.

Most Recent Publications

Two constraint compilation methods for lifted planning

Two constraint compilation methods for lifted planning

Altmetric score is

Planning for temporally extended goals in pure-past linear temporal logic

Planning for temporally extended goals in pure-past linear temporal logic

Altmetric score is

Conditional effects in numeric planning reloaded

Conditional effects in numeric planning reloaded

Altmetric score is

On using lazy greedy best-first search with subgoaling relaxation in numeric planning problems

On using lazy greedy best-first search with subgoaling relaxation in numeric planning problems

Altmetric score is

BLAST: bit-blasting numbers for classical planning (extended abstract)

BLAST: bit-blasting numbers for classical planning (extended abstract)

Altmetric score is
View all

Most Recent Publications

Two constraint compilation methods for lifted planning

Two constraint compilation methods for lifted planning

Altmetric score is

Planning for temporally extended goals in pure-past linear temporal logic

Planning for temporally extended goals in pure-past linear temporal logic

Altmetric score is

Conditional effects in numeric planning reloaded

Conditional effects in numeric planning reloaded

Altmetric score is

On using lazy greedy best-first search with subgoaling relaxation in numeric planning problems

On using lazy greedy best-first search with subgoaling relaxation in numeric planning problems

Altmetric score is

BLAST: bit-blasting numbers for classical planning (extended abstract)

BLAST: bit-blasting numbers for classical planning (extended abstract)

Altmetric score is
View all