Related papers: Parking Functions: Choose Your Own Adventure
Visual place recognition is a fundamental capability for the localization of mobile robots. It places image retrieval in the practical context of physical agents operating in a physical world. It is an active field of research and many…
Reinforcement learning has emerged as an important approach for autonomous driving. A reward function is used in reinforcement learning to establish the learned skill objectives and guide the agent toward the optimal policy. Since…
We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the…
Recall that $\alpha=(a_1,a_2,\ldots,a_n)\in[n]^n$ is a parking function if its nondecreasing rearrangement $\beta=(b_1,b_2,\ldots,b_n)$ satisfies $b_i\leq i$ for all $1\leq i\leq n$. In this article, we study parking functions based on…
Autonomous parking technology is a key concept within autonomous driving research. This paper will propose an imaginative autonomous parking algorithm to solve issues concerned with parking. The proposed algorithm consists of three parts:…
This study presents a new user experience in apartment searches using functionality and comfort as query items. This study has three technical contributions. First, we present a new dataset on the perceived functionality and comfort scores…
The problem of path planning for automated parking is usually presented as finding a collision-free path from initial to goal positions, where three out of four parking slot edges represent obstacles. We rethink the path planning problem…
Let $\mathcal{P}_n$ be the convex hull in $\mathbb{R}^n$ of all parking functions of length $n$. Stanley found the number of vertices and the number of facets of $\mathcal{P}_n$. Building upon these results, we determine the number of faces…
We introduce type C parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type C parking functions to regions of the Shi arrangement of type C, encoded as diagonally…
There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of…
We give an exact enumerative formula for the minimal acyclic deterministic finite automata. This formula is obtained from a bijection between a family of generalized parking functions and the transitions functions of acyclic automata.
A parking function of length n is a sequence (b_1, b_2,..., b_n) of nonnegative integers whose nondecreasing rearrangement (a_1, a_2,...,a_n) has the property that a_i < i for every i. A well-known result about parking functions is that the…
The terminological landscape is rather cluttered when referring to autonomous driving or vehicles. A plethora of terms are used interchangeably, leading to misuse and confusion. With its technological, social and legal progress, it is…
It is often difficult to hand-specify what the correct reward function is for a task, so researchers have instead aimed to learn reward functions from human behavior or feedback. The types of behavior interpreted as evidence of the reward…
In 2000, it was demonstrated that the set of $x$-parking functions of length $n$, where $x$=($a,b,...,b$) $\in \mathbbm{N}^n$, is equivalent to the set of rooted multicolored forests on [$n$]=\{1,...,$n$\}. In 2020, Yue Cai and Catherine H.…
With growing numbers of intelligent autonomous systems in human environments, the ability of such systems to perceive, understand and anticipate human behavior becomes increasingly important. Specifically, predicting future positions of…
In this paper a functionality taxonomy for document search engines is proposed. It can be used to assess the features of a search engine, to position search engines relative to each other, or to select which search engine 'fits' a certain…
The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…
As the industry of autonomous driving grows, so does the potential interaction of groups of autonomous cars. Combined with the advancement of Artificial Intelligence and simulation, such groups can be simulated, and safety-critical models…
Yampolskiy and others have shown that the space of possible minds is vast, actually infinite (Yampolskiy, 2015). A question of interest is 'Which activities can minds perform during their lifetime?' This question is very broad, thus in this…