Engineering Papers⌕ Search

DOE OSTI · 939934

Optimal parametric discrete event control: Problem and solution

Abstract

We present a novel optimization problem for discrete event control, similar in spirit to the optimal parametric control problem common in statistical process control. In our problem, we assume a known finite state machine plant model G defined over an event alphabet Sigma so that the plant model language L = L M (G) is prefix closed. We further assume the existence of a base control structure M K , which may be either a finite state machine or a deterministic pushdown machine. If K = L M (M K ), we assume K is prefix closed and that K C L. We associate each controllable transition of M K with a binary variable X 1 ,..., X n middot indicating whether the transition is enabled or not. This leads to a function M K (X 1 , ,...,- , X n ), that returns a new control specification depending upon the values of X 1 ,..., X n middot We exhibit a branch-and-bound algorithm to solve the optimization problem minx 1 x,...x n &maxwwepsiK C(w) such that M K (X 1 ,...,X n ) \= |= and L M (M K (X 1 ,...,- , X n middot)) epsi C(L). Here . is a set of logical assertions on the structure of M K (X 1 , X 1 ,...,- , X n middot), and M K (X 1 ,...,- , X n middot) \= || indicates that M K (X 1 ,...,- , X n ) satisfies the logical assertions; and, C(L) is the set of controllable sublanguages of L 1 .

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Griffin, Christopher H.. 2008-06-01. Optimal parametric discrete event control: Problem and solution. https://doi.org/10.1109/acc.2008.4586650. https://engineeringpapers.com/record/osti%3A939934/optimal-parametric-discrete-event-control-problem-and-solution

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related reports

Large language models for transportation research: Methodologies, state of the art, and future opportunities

The rapid rise of large language models (LLMs) is transforming transportation research, with significant advancements emerging between 2023 and 2025, a period marked by the inception and swift growth of adopting and adapting LLMs for various transportation applications. Despite these significant advancements, however, a systematic review and synthesis of the existing literature remains lacking. This paper aims to fill this gap by providing a comprehensive review of the methodologies and applications of LLMs in transportation. We explore key applications, including autonomous driving, travel behavior prediction, and general transportation-related queries, alongside LLM methodologies such as zero- or few-shot learning, prompt engineering, and fine-tuning. From the review, critical research gaps are identified. From the methodological perspective, many of the research limitations can be addressed by integrating LLMs with existing tools and refining LLM architectures. From the application perspective, research opportunities for LLMs to address various transportation challenges are also explored. By synthesizing these findings, this review not only presents the state-of-the-art LLM adoption and adaptation in transportation, but also proposes future research directions as well as insights and recommendations for policymakers and practitioners, paving the way for greater LLM-driven research innovations in transportation in the future.

42 ENGINEERING↗