Searcharxiv⌕ Search

arXiv subjects

Gioele Zardini

Publications and source records attributed to Gioele Zardini.

At least 19 recordsLinked to original sources

Quantale-Enriched Co-Design: Toward a Framework for Quantitative Heterogeneous System Design

Monotone co-design enables compositional engineering design by modeling components as feasibility relations between required resources and provided functionalities. However, its boolean formulation cannot natively represent quantitative criteria such as cost, confidence, or implementation choice. In practice, these considerations are introduced through ad-hoc scalarization or by augmenting the resource space, which obscures system structure and increases computational complexity. Therefore, we develop a quantale-enriched theory of co-design in which resources and functionalities are quantale-enriched categories and design problems are quantale-enriched profunctors, which lifts co-design from boolean feasibility to quantitative evaluation. Series, parallel, and feedback composition remain valid over any commutative quantale, and change-of-base maps between quantales yield heterogeneous composition, so that subsystems evaluated in different local semantics can be composed in a common framework. Numerical examples on a target-tracking system and a UAV delivery problem demonstrate this framework and show how it avoids the drawbacks of boolean-only formulations.

eess.SY↗

Hierarchical Interactions in Mobility Networks: A Model-Free Feedback Approach

Urban mobility systems are large-scale networked systems whose performance emerges from hierarchically coupled decisions of public authorities, competing mobility operators, and travelers. Existing approaches to policy design either collapse one of these levels or assume that the authority can model and differentiate through the equilibrium responses of operators and travelers. In this paper, we model policy design as a tri-level game on a multimodal network, in which a municipality sets taxes, licenses, and integration subsidies, a public transport and a taxi operator compete on prices and service supply, and heterogeneous travelers reach a stochastic user equilibrium. We prove that the traveler equilibrium is unique and continuously differentiable in the operator strategies, that the variational inequality characterizing operator equilibria admits a solution for every policy, and that the resulting tri-level game admits a Stackelberg equilibrium. Building on this structure, we design a model-free hierarchical controller in which the municipality and the operators update their decisions from zeroth-order evaluations of observed equilibrium outcomes. On the Zurich multimodal network, operator equilibria computed from different initializations differ by a median of 0.3% in the municipal objective. On a grid of 3,125 policies, only those that subsidize transfers between public transport and taxis benefit both operators, and 24 of them also lower travel costs without degrading the municipal objective. Finally, the controller matches the best policies of three black-box optimizers and terminates at the most consistent policies across runs.

eess.SY↗

Implementation-Based Incentive Design for Autonomous Mobility-on-Demand and Transit Systems

Achieving a socially desirable operating point for a multimodal transportation system is challenging when Autonomous Mobility-on-Demand (AMoD) and Public Transit (PT) operators pursue selfish objectives alongside endogenous passenger choices. Existing equilibrium-based regulation models typically search over municipal policies to predict the induced operator equilibrium, creating strong behavioral assumptions, equilibrium-selection issues, and difficult bilevel optimization problems. This paper proposes an implementation-based alternative. Rather than asking which municipal action induces the best equilibrium, we ask: given a target operating profile, what minimum realized transfer makes unilateral deviation unattractive for each operator? Using k-implementation theory, this payment decomposes into two unilateral deviation gains: one for the AMoD operator and one for PT. Calculating this payment requires computing three distinct objects: the social target, the AMoD best response, and the PT best response. This is nontrivial because each represents a large-scale network optimization problem complicated by endogenous mode choice and congestion. To address this, we develop tailored mathematical formulations and algorithms for each oracle. For the social target, we derive a decomposition and entropy-regularized mixed-integer convex formulation balancing social optimality and implementability. For the AMoD oracle, we derive an exact reformulation, a convex relaxation providing a global upper bound, and a sequential convex approximation for feasible lower bounds. For the PT oracle, we develop a mixed-integer convex relaxation and characterize its exactness condition. A NYC case study shows the framework computes tight implementation-payment bounds and reveals how the dominant source of incentive misalignment shifts with congestion.

math.OC↗

Principles of Robot Autonomy

Autonomous robots are moving rapidly from research labs into everyday life - on roads, in the air, in warehouses, and in space. Robot autonomy is no longer solely an academic pursuit, but a collection of mature, field-tested methods and tools that practitioners rely on in real-world deployments. This book offers a clear, unified introduction to the methods that make this possible. Built on decades of teaching at Stanford, the text develops the core elements of modern autonomy stacks within a single conceptual framework, bridging classical robotics and modern physical AI. Every major topic is paired with hands-on Jupyter notebooks and implementation-driven exercises, so readers build practical intuition alongside theoretical understanding. The result is a principled, accessible, and deployment-aware foundation for anyone seeking to design, analyze, or contribute to the next generation of autonomous systems. This is a comprehensive resource for students, engineers, and researchers entering one of today's fastest-growing fields.

cs.RO↗

Auditable and Deployable Multi-Agent Motion Planning via Posetal Games from Legal Guidelines

When robots are deployed in the real-world, they must interact with other agents and accomplish their own goals while adhering to legal constraints. These potentially conflicting objectives are often only partially prioritized, making scalarized objectives or fully specified hierarchies unsuitable. We present a framework for multi-agent motion planning under legal requirements based on games with partially ordered preferences (posetal games). Scenario-independent legal guidelines order abstract legal concerns, from which we automatically derive agent preferences and a legal game for any concrete scenario. Agents may refine their legal preferences with private objectives, and regulators may refine the guideline as laws evolve. We prove that such customizations can only remove equilibria and thus preserve legality. To coordinate agents without explicitly communicating private preferences, we introduce belief play, which provably recovers the true equilibria from conservative local games, and a distributed iterative best-response protocol requiring less information. We apply the framework to maritime navigation, systematically lifting pairwise traffic rules to multi-vessel encounters. On seven encounters with up to four vessels, every rule violation of the committed equilibria is certified as forced by the legal hierarchy or unsatisfiable, and defectors are identified from public information in all tested cases. These results indicate that guideline-based posetal games offer an auditable route from partially specified laws to multi-agent motion planning.

cs.MA↗

Compositional Sensitivity Analysis for Multiobjective System Co-Design

Sensitivity analysis of coupled systems typically propagates derivatives of single-valued maps, whereas multiobjective optimization generally treats sensitivity at the system level rather than through interconnected subsystems. We develop a mathematical framework for compositional sensitivity analysis in multiobjective system design, building on monotone co-design. Subsystems are represented as design problems (DPs), interconnected through series, parallel, union, intersection, and feedback composition. We introduce tangential DPs (TDPs) to describe first-order variations around an operating point, show that they preserve the structure of DPs, and characterize their queries through graphical derivatives. To account for multiple internal realizations of a system-level operating point, tangential co-design problems compose families of local TDPs by taking a union over these realizations while retaining the original interconnection structure. We show that these compositions yield families of TDPs and establish conditions under which sensitivity analysis commutes with individual composition operations. Beyond infinitesimal sensitivity, we show that bounded tangential models of convex DPs provide tighter outer approximations of feasible finite changes, which can be propagated through co-design problems without union compositions. We conclude with several convex and nonconvex numerical examples that showcase the framework's accuracy and computational benefits.

math.OC↗

Metric-Based Equilibrium Selection in Noncooperative Differentiable Games

Metric conditioning can change which equilibrium attracts learning dynamics without moving the equilibria of a differentiable game. We study how to use state-dependent symmetric positive-definite (SPD) metrics to select among known equilibria by keeping a designated equilibrium attracting while making a rival unstable. Building on classical results on matrix stability under positive-definite multiplication, we characterize when such destabilization is possible and show how restricting the metric to act independently on each player limits the stability changes that can be achieved at differential Nash equilibria. We then combine a stabilizing metric at the selected equilibrium with a destabilizing metric at the rival through smooth interpolation, yielding a single metric field that preserves every equilibrium of the game while assigning the desired local stability types. We also derive a step-size condition for implementing the method in discrete time. The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner's dilemma, where it selects the desired equilibrium in both settings.

cs.GT↗

Soft yet Effective Robots via Holistic Co-Design

Soft robots promise inherent safety via their material compliance for seamless interactions with humans or delicate environments. Despite progress, the field struggles to balance task-specific performance with broader factors like durability and manufacturability--a difficulty that we find is compounded by traditional sequential design processes with their lack of feedback loops. In this perspective, we review emerging co-design approaches that simultaneously optimize the soft robot's body and brain, enabling the discovery of unconventional designs highly tailored to the given tasks. Their adoption is limited by narrow objectives, gaps between simulated and real performance, and computational cost. To address these challenges, we propose a holistic co-design framework that incorporates a broader range of design values, integrates real-world prototyping to refine evaluations, and boosts efficiency through surrogate metrics and model-based control strategies. Finally, we outline research priorities in design priors and metrics, AI-assisted evaluation, and balancing computational refinement with physical testing and safety with performance.

cs.RO↗

Task-Driven Co-Design of Heterogeneous Multi-Robot Systems

The design of multi-agent robotic systems involves tightly coupled decisions spanning heterogeneous domains, including robot design, fleet composition, and planning. Much effort has been devoted to isolated improvements in these domains, while system-level co-design considering trade-offs and task requirements remains underexplored. In this work, we present a formal and compositional framework for the task-driven co-design of heterogeneous multi-robot systems, and propose robotic phase diagrams as a qualitative design guideline. Building on monotone co-design theory, we introduce general abstractions of robots, fleets, planners, executors, and evaluators as interconnected design problems with well-defined interfaces that are agnostic to both implementations and tasks. This structure enables efficient joint optimization of robot design, fleet composition, and planning under task-specific performance constraints. A series of case studies demonstrates the capabilities of the framework. New component solutions can be seamlessly incorporated, including robot types, task profiles, and probabilistic sensing objectives, while non-obvious design alternatives are systematically uncovered with optimality guarantees. The results highlight the flexibility, scalability, and interpretability of the proposed approach, illustrate how formal co-design enables principled reasoning about complex heterogeneous multi-robot systems, and how a robotic phase diagram qualitatively guides the design.

cs.RO↗

Co-Investment with Payoff-Sharing Mechanism for Cooperative Decision-Making in Network Design Games

Network-based systems are inherently interconnected, with the design and performance of subnetworks being interdependent. However, the decisions of self-interested operators may lead to suboptimal outcomes for users and the overall system. This paper explores cooperative mechanisms that can simultaneously benefit both operators and users. We address this challenge using a game-theoretical framework that integrates both non-cooperative and cooperative game theory. In the non-cooperative stage, we propose a network design game in which subnetwork decision-makers strategically design local infrastructures. In the cooperative stage, co-investment with payoff-sharing mechanism is developed to enlarge collective benefits and fairly distribute them. To demonstrate the effectiveness of our framework, we conduct case studies on the Sioux Falls network and real-world public transport networks in Zurich and Winterthur, Switzerland. Our evaluation considers impacts on environmental sustainability, social welfare, and economic efficiency. The proposed framework provides a foundation for improving interdependent networked systems by enabling strategic cooperation among self-interested operators.

eess.SY↗

Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems

Region-of-attraction (ROA) certificates for polynomial systems become expensive as state dimension and degree grow: direct sum-of-squares (SOS) formulations require combinatorially growing monomial bases. Quadratization represents a polynomial vector field exactly on an invariant manifold of a quadratic system, allowing a quadratic Lyapunov function to certify the ROA. For a fixed lift, stabilizer gains shape the off-manifold extension and transverse dynamics, while representation gauges change the matrix representation but not the vector field. Both affect the spectral-norm certificate, yet prior work fixes the gain by a feasibility heuristic before optimizing the gauge. We formulate optimal dissipative quadratization (ODQ), jointly designing gains and gauges for a fixed monomial lift, reference extension, stabilizer factorization, and Lyapunov weight $Q=I$. Gains lie in a prescribed compact Hurwitz box. At each gain, an exact semidefinite program globally minimizes the spectral-norm bound over the gauge. Residual-aware bounds yield a certified closed Lyapunov sublevel set, accounting for the floating-point Lyapunov residual. Under our stated assumptions, every accumulation point of the idealized outer search is box-Clarke stationary. A finite run returns the best independently verified candidate; global optimality of the gain search is not claimed. On a planar quintic, optimizing the gain increases the certified area by a factor of $2.238$ over a matched zero-gain gauge. Across 16 heterogeneous polynomial systems with stabilizer freedom, ODQ improves on both fixed-gain lifted baselines. All 36 ODQ runs on the relay benchmark complete, and all 27 repeat-level comparisons across nine fully paired cases favor ODQ over an SOS baseline with a fixed quadratic Lyapunov function in both the fixed-direction proxy and construction time. Broader comparisons with direct SOS methods remain mixed.

math.OC↗

Estimate then Predict: Convex Formulation for Travel Demand Forecasting

Travel demand forecasting is essential for evaluating large-scale infrastructure projects, yet the traditional sequential four-step process can produce inconsistencies across trip distribution, mode choice, and traffic assignment. Although combined models address these inconsistencies, their practical use has been limited by simplified behavioral assumptions, computational burden, and the lack of a unified parameter-estimation framework. We propose a convex programming approach that integrates destination, mode, and route choices within a hierarchical extended logit model. The optimal primal solution characterizes the joint travel-demand equilibrium, while the optimal dual variables recover taste coefficients, alternative-specific constants, and destination- and mode-level scale parameters. The model captures mode correlations through nested logit and route overlap through path-size logit. Its convex structure provides global optimality guarantees and enables efficient solution using off-the-shelf conic solvers. Observed travel patterns are incorporated through moment and conditional-entropy constraints, while the route-level dispersion parameter is calibrated separately using partial link counts. Numerical experiments on eight benchmark networks demonstrate the scalability and computational efficiency of the formulation.

cs.GT↗

Denoising as Projection: Constrained Optimization with Gradient-Guided Diffusion

Diffusion models are increasingly used not only for sampling from learned data distributions, but also for generating samples that optimize task-specific objectives. A common approach is to guide the reverse diffusion process using gradients of an external objective. However, when the data distribution is supported on a structured feasible set, such as a manifold or a constraint set, gradient guidance can move samples away from the learned data geometry. In this paper, we study a simple projected-gradient-guided diffusion update based on the observation that the Stein denoising operator can act as an approximate projection onto the data geometry. The proposed update incorporates the objective gradient inside the denoising step, yielding an inference-time method that uses only a pretrained denoiser and gradient evaluations. We analyze this update as an inexact projected-gradient method for constrained optimization over learned feasible geometries. Our theory covers three settings: linear manifolds, compact convex feasible sets, and compact Riemannian submanifolds. In all these settings, we prove descent and finite-time convergence guarantees. Numerical experiments support the theoretical interpretation and illustrate how the proposed update balances objective descent with preservation of the learned geometry.

cs.LG↗

A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems

We propose the Adaptive Levenberg-Marquardt Third-Order Newton Method (ALM-TON) method for unconstrained nonconvex optimization; to our knowledge, the framework provides the first globally convergent realization of the unregularized third-order Newton method. Unlike the standard Adaptive Regularization framework with third-order models (AR3), which enforces global behavior through a quartic term, ALMTON employs an adaptive Levenberg-Marquardt (quadratic) regularization. This choice preserves a cubic model at every iteration, so that every subproblem is a tractable semidefinite programming (SDP). Algorithmically, ALMTON follows a mixed-mode strategy: it attempts an unregularized thirdorder step whenever the cubic Taylor model admits a strict local minimizer with adequate curvature, and activates (or increases) quadratic regularization only when needed to ensure that the model is well posed and the step is globally reliable. For the Heuristic strategy, under the stated assumptions and an exact local-minimizer oracle, we prove finite termination at an $ε$-approximate first-order stationary point with $O\left(ε^{-2}\right)$ worst-case evaluation complexity. Moreover, if an accepted iterate enters the stated neighborhood of a positive-definite local minimizer, subsequent nonterminal steps recover the unregularized third-order Newton recursion and its cubic local rate. Under a common post hoc terminal audit over 4,500 deterministic starts on five two-dimensional nonconvex problems, both ALMTON variants satisfy the terminal criterion on $99.91 \%$ of the instances, compared with $55.42 \%$ for the unregularized third-order Newton method. This robustness gain comes at substantial SDP cost: AR$2$ is faster, so the results support robust globalization of the unregularized cubic model rather than overall empirical superiority.

math.OC↗

A Category-Theoretic Framework from Biological Mechanics to Engineered Stimulus-Response Systems

Natural materials achieve adaptive behavior through hierarchical organization and coupled mechanisms across scales. Their translation into engineering, however, remains largely heuristic. What is missing is a formal translation framework that carries biological design logic into engineered realization while preserving physical consistency across levels of abstraction. Here we present a category theoretic compositional framework for verified nature-derived design. The framework defines a category of stimulus response dynamical systems with natural and artificial subcategories. It introduces a structure preserving implementation functor from biological mechanics to engineered systems. It also formalizes a machine agnostic specification layer that links behavioral intent to executable fabrication programs. We instantiate the framework on the hygromorphic pinecone hierarchy as a representative biological case. We implement the full pipeline in Grasshopper, where formal specifications are translated into modular parametric scripts that preserve the compositional structure of the model. The resulting designs are fabricated by fused filament fabrication, evaluated experimentally, and tested against model predictions derived from the pipeline. The current implementation generates four actuator classes spanning two stimulus types and two kinematic responses. One actuator arises purely through composition from previously validated components, without additional manual derivation. The results show that compositionality can function not just as a descriptive language, but as a generative and system level verifiable method for mechanical material design. More broadly, the work provides a concrete route for embedding formal multiscale reasoning within increasingly computational, generative, and physics-driven design workflows.

cond-mat.soft↗

Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search

Conflict-Based Search (CBS) is a leading exact algorithm for Multi-Agent Path Finding (MAPF), but its high-level node-selection rule is usually treated as a fixed implementation detail. Standard best-first selection is strong for minimizing expanded nodes and closing the optimality certificate, yet it can maintain a large frontier, interrupt parent-child expansion sequences, and provide no feasible incumbent until termination. This paper studies node selection as a first-class design choice for exact CBS. We introduce Dual-Informed Vertical Expansion (DIVE), a policy that is best-bound between dives and depth-oriented within a dive. DIVE starts each dive from the current best-bound frontier, follows promising children to exploit parent-child locality, and uses incumbent pruning to limit unproductive excursions. We formalize CBS node selection through a branch-and-bound view, prove that the traversal policy can be changed without affecting exactness, and analyze the resulting trade-offs among expanded nodes, dive breaks, queue size, and primal-dual bound progress. The analysis predicts three complementary extremes. Best-first search is node efficient, iterative deepening is memory efficient, and DIVE is dive efficient while retaining regular best-bound reanchoring. Experiments on standard MAPF benchmarks support this trade-off map. DIVE consistently reduces dive breaks, provides early incumbents with certified gaps, uses substantially less queue memory than best-first search, and benefits from warm starts and simple responsive variants in dense or memory-limited regimes.

cs.RO↗

Weaves, Wires, and Morphisms: Formalizing and Implementing the Algebra of Deep Learning

Despite deep learning models running well-defined mathematical functions, we lack a formal mathematical framework for describing model architectures. Ad-hoc notation, diagrams, and pseudocode poorly handle nonlinear broadcasting and the relationship between individual components and composed models. This paper introduces a categorical framework for deep learning models that formalizes broadcasting through the novel axis-stride and array-broadcasted categories. This allows the mathematical function underlying architectures to be precisely expressed and manipulated in a compositional manner. These mathematical definitions are translated into human manageable diagrams and machine manageable data structures. We provide a mirrored implementation in Python (pyncd) and TypeScript (tsncd) to show the universal aspect of our framework, along with features including algebraic construction, graph conversion, PyTorch compilation and diagram rendering. This lays the foundation for a systematic, formal approach to deep learning model design and analysis.

cs.LG↗

Distributional Uncertainty and Adaptive Decision-Making in System Co-design

Complex engineered systems require coordinated design choices across heterogeneous components under conflicting objectives and uncertain specifications. Monotone co-design provides a compositional framework for such problems. Performance of each subsystem is modeled with a design problem: a relation specifying what resources suffice to provide each functionality. Existing uncertain co-design models rely on interval bounds, which support worst-case reasoning but cannot represent probabilistic risk or multi-stage adaptive decisions. We develop a distributional extension of co-design that models uncertain design outcomes as distributions over design problems and supports adaptive decision processes through Markov-kernel re-parameterizations. Using quasi-measurable and quasi-universal spaces, we show that the standard co-design compositions remain compositional under this richer uncertainty, and introduce queries and observations extracting probabilistic trade-offs, including feasibility probabilities, confidence bounds, and distributions of minimal required resources. A task-driven unmanned aerial vehicle case study shows how the framework captures risk-sensitive and information-dependent design choices that interval models cannot express.

math.OC↗