Algorithm for UAV path planning in high obstacle density environments: RFA-star

W Zhang, J Li, W Yu, P Ding, J Wang… - Frontiers in Plant …, 2024 - frontiersin.org
Path planning is one of the key elements for achieving rapid and stable flight when
unmanned aerial vehicles (UAVs) are conducting monitoring and inspection tasks at ultra …

[HTML][HTML] Solving infinite-domain CSPs using the patchwork property

KK Dabrowski, P Jonsson, S Ordyniak, G Osipov - Artificial Intelligence, 2023 - Elsevier
The constraint satisfaction problem (CSP) has important applications in computer science
and AI. In particular, infinite-domain CSPs have been intensively used in subareas of AI …

Computational Short Cuts in Infinite Domain Constraint Satisfaction

P Jonsson, V Lagerkvist, S Ordyniak - Journal of Artificial Intelligence …, 2022 - jair.org
A backdoor in a finite-domain CSP instance is a set of variables where each possible
instantiation moves the instance into a polynomial-time solvable class. Backdoors have …

A multivariate complexity analysis of qualitative reasoning problems

L Eriksson, V Lagerkvist - arXiv preprint arXiv:2209.15275, 2022 - arxiv.org
Qualitative reasoning is an important subfield of artificial intelligence where one describes
relationships with qualitative, rather than numerical, relations. Many such reasoning tasks …

A fast algorithm for consistency checking partially ordered time

L Eriksson, V Lagerkvist - arXiv preprint arXiv:2305.15917, 2023 - arxiv.org
Partially ordered models of time occur naturally in applications where agents or processes
cannot perfectly communicate with each other, and can be traced back to the seminal work …

Improved algorithms for Allen's interval algebra by dynamic programming with sublinear partitioning

L Eriksson, V Lagerkvist - arXiv preprint arXiv:2305.15950, 2023 - arxiv.org
Allen's interval algebra is one of the most well-known calculi in qualitative temporal
reasoning with numerous applications in artificial intelligence. Recently, there has been a …