SearcharxivSearch

arXiv subjects

John Talbot

Publications and source records attributed to John Talbot.

At least 19 recordsLinked to original sources

Boundary Sampling to Learn Predictive Safety Filters via Pontryagin's Maximum Principle

Safety filters provide a practical approach for enforcing safety constraints in autonomous systems. While learning-based tools scale to high-dimensional systems, their performance depends on informative data that includes states likely to lead to constraint violation, which can be difficult to efficiently sample in complex, high-dimensional systems. In this work, we characterize trajectories that barely avoid safety violations using the Pontryagin Maximum Principle. These boundary trajectories are used to guide data collection for learned Hamilton-Jacobi Reachability, concentrating learning efforts near safety-critical states to improve efficiency. The learned Control Barrier Value Function is then used directly for safety filtering. Simulations and experimental validation on a shared-control automotive racing application demonstrate PMP sampling improves learning efficiency, yielding faster convergence, reduced failure rates, and improved safe set reconstruction, with wall times around 3ms.

cs.RO

Control Barrier Functions for Shared Control and Vehicle Safety

This manuscript presents a control barrier function based approach to shared control for preventing a vehicle from entering the part of the state space where it is unrecoverable. The maximal phase recoverable ellipse is presented as a safe set in the sideslip angle--yaw rate phase plane where the vehicle's state can be maintained. An exponential control barrier function is then defined on the maximal phase recoverable ellipse to promote safety. Simulations demonstrate that this approach enables safe drifting, that is, driving at the handling limit without spinning out. Results are then validated for shared control drifting with an experimental vehicle in a closed course. The results show the ability of this shared control formulation to maintain the vehicle's state within a safe domain in a computationally efficient manner, even in extreme drifting maneuvers.

eess.SY

Degree sequences of triangular multigraphs

A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms are all at least 4 is the degree sequence of a triangular simple graph, and proved this in some special cases. In this paper we state and prove the analogous version of this conjecture for multigraphs.

math.CO

A collection of open problems in celebration of Imre Leader's 60th birthday

One of the great pleasures of working with Imre Leader is to experience his infectious delight on encountering a compelling combinatorial problem. This collection of open problems in combinatorics has been put together by a subset of his former PhD students and students-of-students for the occasion of his 60th birthday. All of the contributors have been influenced (directly or indirectly) by Imre: his personality, enthusiasm and his approach to mathematics. The problems included cover many of the areas of combinatorial mathematics that Imre is most associated with: including extremal problems on graphs, set systems and permutations, and Ramsey theory. This is a personal selection of problems which we find intriguing and deserving of being better known. It is not intended to be systematic, or to consist of the most significant or difficult questions in any area. Rather, our main aim is to celebrate Imre and his mathematics and to hope that these problems will make him smile. We also hope this collection will be a useful resource for researchers in combinatorics and will stimulate some enjoyable collaborations and beautiful mathematics.

math.CO

The density Tur\'an problem for hypergraphs

Given a $k$-graph $H$ a complete blow-up of $H$ is a $k$-graph $\hat{H}$ formed by replacing each $v\in V(H)$ by a non-empty vertex class $A_v$ and then inserting all edges between any $k$ vertex classes corresponding to an edge of $H$. Given a subgraph $G\subseteq \hat{H}$ and an edge $e\in E(H)$ we define the density $d_e(G)$ to be the proportion of edges present in $G$ between the classes corresponding to $e$. The density Tur\'an problem for $H$ asks: determine the minimal value $d_{crit}(H)$ such that any subgraph $G\subseteq \hat{H}$ satisfying $d_e(G)> d_{crit}(H)$ for every $e\in E(H)$ contains a copy of $H$ as a transversal, i.e. a copy of $H$ meeting each vertex class of $\hat{H}$ exactly once. We give upper bounds for this hypergraph density Tur\'an problem that generalise the known bounds for the case of graphs due to Csikv\'ari and Nagy, [Combinatorics, Probability and Computing, 21(4):531-553, 2012] although our methods are different, employing an entropy compression argument.

math.CO

On Infusing Reachability-Based Safety Assurance within Planning Frameworks for Human-Robot Vehicle Interactions

Action anticipation, intent prediction, and proactive behavior are all desirable characteristics for autonomous driving policies in interactive scenarios. Paramount, however, is ensuring safety on the road -- a key challenge in doing so is accounting for uncertainty in human driver actions without unduly impacting planner performance. This paper introduces a minimally-interventional safety controller operating within an autonomous vehicle control stack with the role of ensuring collision-free interaction with an externally controlled (e.g., human-driven) counterpart while respecting static obstacles such as a road boundary wall. We leverage reachability analysis to construct a real-time (100Hz) controller that serves the dual role of (i) tracking an input trajectory from a higher-level planning algorithm using model predictive control, and (ii) assuring safety by maintaining the availability of a collision-free escape maneuver as a persistent constraint regardless of whatever future actions the other car takes. A full-scale steer-by-wire platform is used to conduct traffic weaving experiments wherein two cars, initially side-by-side, must swap lanes in a limited amount of time and distance, emulating cars merging onto/off of a highway. We demonstrate that, with our control stack, the autonomous vehicle is able to avoid collision even when the other car defies the planner's expectations and takes dangerous actions, either carelessly or with the intent to collide, and otherwise deviates minimally from the planned trajectory to the extent required to maintain safety.

cs.RO

Precise astrometry and diameters of asteroids from occultations -- a data-set of observations and their interpretation

Occultations of stars by asteroids have been observed since 1961, increasing from a very small number to now over 500 annually. We have created and regularly maintain a growing data-set of more than 5,000 observed asteroidal occultations. The data-set includes: the raw observations; astrometry at the 1 mas level based on centre of mass or figure (not illumination); where possible the asteroid's diameter to 5 km or better, and fits to shape models; the separation and diameters of asteroidal satellites; and double star discoveries with typical separations being in the tens of mas or less. The data-set is published at NASA's Planetary Data System and is regularly updated. We provide here an overview of the data-set, discuss the issues associated with determining the astrometry and diameters, and give examples of what can be derived from the data-set. We also compare the occultation diameters of asteroids with the diameters measured by the satellites NEOWISE, AKARI AcuA, and IRAS, and show that the best satellite-determined diameter is a combination of the diameters from all three satellites.

astro-ph.EP

Decomposing tournaments into paths

We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by K\"uhn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number of paths needed in a path decomposition of a general tournament $T$. There is a natural lower bound for this number in terms of the degree sequence of $T$ and it is conjectured that this bound is correct for tournaments of even order. Almost all cases of the conjecture are open and we prove many of them.

math.CO

On Infusing Reachability-Based Safety Assurance within Probabilistic Planning Frameworks for Human-Robot Vehicle Interactions

Action anticipation, intent prediction, and proactive behavior are all desirable characteristics for autonomous driving policies in interactive scenarios. Paramount, however, is ensuring safety on the road --- a key challenge in doing so is accounting for uncertainty in human driver actions without unduly impacting planner performance. This paper introduces a minimally-interventional safety controller operating within an autonomous vehicle control stack with the role of ensuring collision-free interaction with an externally controlled (e.g., human-driven) counterpart. We leverage reachability analysis to construct a real-time (100Hz) controller that serves the dual role of (1) tracking an input trajectory from a higher-level planning algorithm using model predictive control, and (2) assuring safety through maintaining the availability of a collision-free escape maneuver as a persistent constraint regardless of whatever future actions the other car takes. A full-scale steer-by-wire platform is used to conduct traffic weaving experiments wherein the two cars, initially side-by-side, must swap lanes in a limited amount of time and distance, emulating cars merging onto/off of a highway. We demonstrate that, with our control stack, the autonomous vehicle is able to avoid collision even when the other car defies the planner's expectations and takes dangerous actions, either carelessly or with the intent to collide, and otherwise deviates minimally from the planned trajectory to the extent required to maintain safety.

cs.RO

On Borrowed Time: The Past, Present, and Future of Virginia's Barrier Islands under Differing Sea-Level Rise Scenarios

Virginia's barrier islands constitute one of the most undeveloped shorelines of the eastern US. Aside from a few islands in the north, the islands are uninhabited and managed for conservation. These islands play important environmental, cultural, and economic roles along Virginia's Eastern Shore. Climate change driven sea-level rise is already having a major impact on these islands and threatens their existence. We utilize transect analysis across each of the barrier islands to depict the shoreline change trends annually from 1850 to 2010. We then utilize time series forecasting and panel modeling to estimate future shorelines up to and including a best estimate 2099 CE shoreline. Results indicate that across almost all the islands, the shoreline retreat rate has been increasing over time. Additionally, we find that year 2100 CE sea-level rise scenarios are likely to accelerate the shoreline retreat occurring on these islands and may erase many of them all together. We find that the northern islands of Wallops and North Assateague will remain generally stable whereas many of the remaining islands will likely experience rapid shoreline retreat under future sea-level rise scenarios.

physics.geo-ph

Polychromatic Colorings on the Integers

We show that for any set $S\subseteq \mathbb{Z}$, $|S|=4$ there exists a 3-coloring of $\mathbb{Z}$ in which every translate of $S$ receives all three colors. This implies that $S$ has a codensity of at most $1/3$, proving a conjecture of Newman [D. J. Newman, Complements of finite sets of integers, Michigan Math. J. 14 (1967) 481--486]. We also consider related questions in $\mathbb{Z}^d$, $d\geq 2$.

math.CO

Volumes and bulk densities of forty asteroids from ADAM shape modeling

Disk-integrated photometric data of asteroids do not contain accurate information on shape details or size scale. Additional data such as disk-resolved images or stellar occultation measurements further constrain asteroid shapes and allow size estimates. We aim to use all available disk-resolved images of about forty asteroids obtained by the Near-InfraRed Camera (Nirc2) mounted on the W.M. Keck II telescope together with the disk-integrated photometry and stellar occultation measurements to determine their volumes. We can then use the volume, in combination with the known mass, to derive the bulk density. We download and process all asteroid disk-resolved images obtained by the Nirc2 that are available in the Keck Observatory Archive (KOA). We combine optical disk-integrated data and stellar occultation profiles with the disk-resolved images and use the All-Data Asteroid Modeling (ADAM) algorithm for the shape and size modeling. Our approach provides constraints on the expected uncertainty in the volume and size as well. We present shape models and volume for 41 asteroids. For 35 asteroids, the knowledge of their mass estimates from the literature allowed us to derive their bulk densities. We clearly see a trend of lower bulk densities for primitive objects (C-complex) than for S-complex asteroids. The range of densities in the X-complex is large, suggesting various compositions. Moreover, we identified a few objects with rather peculiar bulk densities, which is likely a hint of their poor mass estimates. Asteroid masses determined from the Gaia astrometric observations should further refine most of the density estimates.

astro-ph.EP

Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles

If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polychromatic number of G, denoted poly_H(G), is the largest number of colors in an H-polychromatic coloring. In this paper, poly_H(G) is determined exactly when G is a complete graph and H is the family of all 1-factors. In addition poly_H(G) is found up to an additive constant term when G is a complete graph and H is the family of all 2-factors, or the family of all Hamiltonian cycles.

math.CO

Polychromatic Colorings on the Hypercube

Given a subgraph G of the hypercube Q_n, a coloring of the edges of Q_n such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The maximum number of colors with which it is possible to G-polychromatically color the edges of any hypercube is called the polychromatic number of G. To determine polychromatic numbers, it is only necessary to consider a structured class of colorings, which we call simple. The main tool for finding upper bounds on polychromatic numbers is to translate the question of polychromatically coloring the hypercube so every embedding of a graph G contains every color into a question of coloring the 2-dimensional grid so that every so-called shape sequence corresponding to G contains every color. After surveying the tools for finding polychromatic numbers, we apply these techniques to find polychromatic numbers of a class of graphs called punctured hypercubes. We also consider the problem of finding polychromatic numbers in the setting where larger subcubes of the hypercube are colored. We exhibit two new constructions which show that this problem is not a straightforward generalization of the edge coloring problem.

math.CO

An exact Tur\'an result for tripartite 3-graphs

Mantel's theorem says that among all triangle-free graphs of a given order the balanced complete bipartite graph is the unique graph of maximum size. We prove an analogue of this result for 3-graphs. Let $K_4^-=\{123,124,134\}$, $F_6=\{123,124,345,156\}$ and $\mathcal{F}=\{K_4^-,F_6\}$: for $n\neq 5$ the unique $\mathcal{F}$-free 3-graph of order $n$ and maximum size is the balanced complete tripartite 3-graph $S_3(n)$ (for $n=5$ it is $C_5^{(3)}=\{123,234,345,145,125\}$). This extends an old result of Bollob\'as that $S_3(n) $ is the unique 3-graph of maximum size with no copy of $K_4^-=\{123,124,134\}$ or $F_5=\{123,124,345\}$.

math.CO

A solution to the 2/3 conjecture

We prove a vertex domination conjecture of Erd\H os, Faudree, Gould, Gy\'arf\'as, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours there exists a set of at most three vertices which have at least 2n/3 neighbours in one of the colours. Our proof makes extensive use of the ideas presented in "A New Bound for the 2/3 Conjecture" by Kr\'al', Liu, Sereni, Whalen, and Yilma.

math.CO

Vertex Ramsey problems in the hypercube

If we 2-color the vertices of a large hypercube what monochromatic substructures are we guaranteed to find? Call a set S of vertices from Q_d, the d-dimensional hypercube, Ramsey if any 2-coloring of the vertices of Q_n, for n sufficiently large, contains a monochromatic copy of S. Ramsey's theorem tells us that for any r \geq 1 every 2-coloring of a sufficiently large r-uniform hypergraph will contain a large monochromatic clique (a complete subhypergraph): hence any set of vertices from Q_d that all have the same weight is Ramsey. A natural question to ask is: which sets S corresponding to unions of cliques of different weights from Q_d are Ramsey? The answer to this question depends on the number of cliques involved. In particular we determine which unions of 2 or 3 cliques are Ramsey and then show, using a probabilistic argument, that any non-trivial union of 39 or more cliques of different weights cannot be Ramsey. A key tool is a lemma which reduces questions concerning monochromatic configurations in the hypercube to questions about monochromatic translates of sets of integers.

math.CO

New Tur\'an densities for 3-graphs

If $\mathcal{F}$ is a family of graphs then the Tur\'an density of $\mathcal{F}$ is determined by the minimum chromatic number of the members of $\mathcal{F}$. The situation for Tur\'an densities of 3-graphs is far more complex and still very unclear. Our aim in this paper is to present new exact Tur\'an densities for individual and finite families of 3-graphs, in many cases we are also able to give corresponding stability results. As well as providing new examples of individual 3-graphs with Tur\'an densities equal to 2/9,4/9,5/9 and 3/4 we also give examples of irrational Tur\'an densities for finite families of 3-graphs, disproving a conjecture of Chung and Graham. (Pikhurko has independently disproved this conjecture by a very different method.) A central question in this area, known as Tur\'an's problem, is to determine the Tur\'an density of $K_4^{(3)}=\{123,124, 134, 234\}$. Tur\'an conjectured that this should be 5/9. Razborov [On 3-hypergraphs with forbidden 4-vertex configurations, in SIAM J. Disc. Math. 24 (2010), 946-963] showed that if we consider the induced Tur\'an problem forbidding $K_4^{(3)}$ and $E_1$, the 3-graph with 4 vertices and a single edge, then the Tur\'an density is indeed 5/9. We give some new non-induced results of a similar nature, in particular we show that $\pi(K_4^{(3)},H)=5/9$ for a 3-graph $H$ satisfying $\pi(H)=3/4$. We end with a number of open questions focusing mainly on the topic of which values can occur as Tur\'an densities. Our work is mainly computational, making use of Razborov's flag algebra framework. However all proofs are exact in the sense that they can be verified without the use of any floating point operations. Indeed all verifying computations use only integer operations, working either over $\mathbb{Q}$ or in the case of irrational Tur\'an densities over an appropriate quadratic extension of $\mathbb{Q}$.

math.CO