Tootfinder

Hybrid Conformal Prediction-based Risk-Aware Model Predictive Planning in Dense, Uncertain Environments
Jeongyong Yang, KwangBin Lee, SooJean Han
https://arxiv.org/abs/2507.11920 …

Hybrid Conformal Prediction-based Risk-Aware Model Predictive Planning in Dense, Uncertain Environments
Real-time path planning in dense, uncertain environments remains a challenging problem, as predicting the future motions of numerous dynamic obstacles is computationally burdensome and unrealistic. To address this, we introduce Hybrid Prediction-based Risk-Aware Planning (HyPRAP), a prediction-based risk-aware path-planning framework which uses a hybrid combination of models to predict local obstacle movement. HyPRAP uses a novel Prediction-based Collision Risk Index (P-CRI) to evaluate the ris…

Damn; I quite liked the ammonia story;
https://www.hydrogeninsight.com/production/air-products-shelves-2bn-plan-to-import-green-ammonia-to-uk-and-crack-it-back-to-hydrogen/2-1-1833888

Air Products shelves £2bn plan to import green ammonia to UK and crack it back to hydrogen
The industrial gases firm had received planning permission for the Immingham terminal earlier this year, but blames lack of policy support for its decision

Sources: Microsoft plans to announce thousands of job cuts, particularly in sales, early next month after the end of its fiscal year (Bloomberg)
https://www.bloomberg.com/news/articles/2025-06-18/microsoft-planning…

Predicting Pulmonary Hypertension in Newborns: A Multi-view VAE Approach
Lucas Erlacher, Samuel Ruip\'erez-Campillo, Holger Michel, Sven Wellmann, Thomas M. Sutter, Ece Ozkan, Julia E. Vogt
https://arxiv.org/abs/2507.11561

Predicting Pulmonary Hypertension in Newborns: A Multi-view VAE Approach
Pulmonary hypertension (PH) in newborns is a critical condition characterized by elevated pressure in the pulmonary arteries, leading to right ventricular strain and heart failure. While right heart catheterization (RHC) is the diagnostic gold standard, echocardiography is preferred due to its non-invasive nature, safety, and accessibility. However, its accuracy highly depends on the operator, making PH assessment subjective. While automated detection methods have been explored, most models foc…

On polynomial progressions via transference
Daniel Altman, Mehtaab Sawhney
https://arxiv.org/abs/2506.13010 https://arxiv.org/pdf/250…

On polynomial progressions via transference
We prove new cases of reasonable bounds for the polynomial Szemerédi theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemerédi's theorem in the integers with fixed polynomial common difference. That is, we prove for any polynomial $P(y)\in \mathbb{Z}[y]$ with $P(0) = 0$, that the largest subset $A\subseteq [N]$ avoiding the pattern \[x, x+P(y),\ldots, x+ kP(y)\] has size bounded by $\ll_{P,k}N(\log\log\log N)^{-Ω_…

Into the Unknown: Applying Inductive Spatial-Semantic Location Embeddings for Predicting Individuals' Mobility Beyond Visited Places
Xinglei Wang, Tao Cheng, Stephen Law, Zichao Zeng, Ilya Ilyankou, Junyuan Liu, Lu Yin, Weiming Huang, Natchapon Jongwiriyanurak
https://arxiv.org/abs/2506.14070…

Into the Unknown: Applying Inductive Spatial-Semantic Location Embeddings for Predicting Individuals' Mobility Beyond Visited Places
Predicting individuals' next locations is a core task in human mobility modelling, with wide-ranging implications for urban planning, transportation, public policy and personalised mobility services. Traditional approaches largely depend on location embeddings learned from historical mobility patterns, limiting their ability to encode explicit spatial information, integrate rich urban semantic context, and accommodate previously unseen locations. To address these challenges, we explore the appl…

Lexicographic products and lexicographic powers of graphs -- a walk matrix approach
Domingos M. Cardoso, Paula Carvalho, Helena Gomes, Sofia J. Pinheiro, Paula Rama
https://arxiv.org/abs/2506.12168

Lexicographic products and lexicographic powers of graphs -- a walk matrix approach
The characteristic polynomial and the spectrum of the lexicographic product of graphs $H[G]$, a specific instance of the generalized composition (also called $H$-join), are explicitly determined for arbitrary graphs $H$ and $G$, in terms of the eigenvalues of $G$ and an $H[G]$ associated matrix $\widetilde{\bf W}$, which relates $H$ with $G$. This study also establishes conditions under which a main eigenvalue of $G$ is a main or non-main eigenvalue of the matrix $\widetilde{\bf W}$, when the n…

IANN-MPPI: Interaction-Aware Neural Network-Enhanced Model Predictive Path Integral Approach for Autonomous Driving
Kanghyun Ryu, Minjun Sung, Piyush Gupta, Jovin D'sa, Faizan M. Tariq, David Isele, Sangjae Bae
https://arxiv.org/abs/2507.11940

IANN-MPPI: Interaction-Aware Neural Network-Enhanced Model Predictive Path Integral Approach for Autonomous Driving
Motion planning for autonomous vehicles (AVs) in dense traffic is challenging, often leading to overly conservative behavior and unmet planning objectives. This challenge stems from the AVs' limited ability to anticipate and respond to the interactive behavior of surrounding agents. Traditional decoupled prediction and planning pipelines rely on non-interactive predictions that overlook the fact that agents often adapt their behavior in response to the AV's actions. To address this, we propose …

Lower bounds for mask polynomials with many cyclotomic divisors
Gergely Kiss, Izabella {\L}aba, Caleb Marshall, G\'abor Somlai
https://arxiv.org/abs/2507.11672

Lower bounds for mask polynomials with many cyclotomic divisors
Given a nonempty set $A \subset \mathbb{N}\cup\{0\}$, define the mask polynomial $A(X)=\sum_{a\in A} X^a$. Suppose that there are $s_1,\dots,s_k\in\nn\setminus\{1\}$ such that the cyclotomic polynomials $Φ_{s_1},\dots,Φ_{s_k}$ divide $A(X)$. What is the smallest possible size of $A$? For $k=1$, this was answered by Lam and Leung in 2000. Less is known about the case when $k\geq 2$; in particular, one may ask whether (similarly to the $k=1$ case) the optimal configurations have a simple ``fibe…

Regrasp Maps for Sequential Manipulation Planning
Svetlana Levit, Marc Toussaint
https://arxiv.org/abs/2507.12407 https://arxiv.org/p…

Regrasp Maps for Sequential Manipulation Planning
We consider manipulation problems in constrained and cluttered settings, which require several regrasps at unknown locations. We propose to inform an optimization-based task and motion planning (TAMP) solver with possible regrasp areas and grasp sequences to speed up the search. Our main idea is to use a state space abstraction, a regrasp map, capturing the combinations of available grasps in different parts of the configuration space, and allowing us to provide the solver with guesses for the …