On the public citation graph
Optimal Control with Weighted Average Costs and Temporal Logic Specifications
0 signed · 48 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0012-365x(78)90011-0openalex-snapshot
A characterization of the minimum cycle mean in a digraph
inferredcites →https://doi.org/10.1016/0166-218x(81)90026-3openalex-snapshot
Parametric shortest path algorithms with an application to cyclic staffing
inferredcites →https://doi.org/10.1109/43.728912openalex-snapshot
Faster maximum and minimum mean cycle algorithms for system-performance analysis
inferredcites →https://doi.org/10.1109/70.508439openalex-snapshot
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
inferredcites →https://doi.org/10.1109/cdc.2008.4739370openalex-snapshot
Optimal control of Mixed Logical Dynamical systems with Linear Temporal Logic specifications
inferredcites →https://doi.org/10.1109/cdc.2009.5400278openalex-snapshot
Sampling-based motion planning with deterministic μ-calculus specifications
inferredcites →https://doi.org/10.1109/tac.2006.876952openalex-snapshot
Reachability and Control Synthesis for Piecewise-Affine Hybrid Systems on Simplices
inferredcites →https://doi.org/10.1109/tac.2007.914952openalex-snapshot
A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
inferredcites →https://doi.org/10.1109/tro.2005.851359openalex-snapshot
Discrete abstractions for robot motion planning and control in polygonal environments
inferredcites →https://doi.org/10.1109/tro.2009.2030225openalex-snapshot
Temporal-Logic-Based Reactive Mission and Motion Planning
inferredcites →https://doi.org/10.1109/tro.2010.2047820openalex-snapshot
Motion Planning With Dynamics by a Synergistic Combination of Layers of Planning
inferredcites →https://doi.org/10.1145/1755952.1755968openalex-snapshot
Receding horizon control for temporal logic specifications
inferredcites →https://doi.org/10.1177/02783640122067453openalex-snapshot
Randomized Kinodynamic Planning
inferredcites →https://doi.org/10.1177/0278364911417911openalex-snapshot
Optimal path planning for surveillance with temporal-logic constraints
inferredcites →https://doi.org/10.21236/ad0646553openalex-snapshot
FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-16595-0_41openalex-snapshot
Online Task Planning and Control for Aerial Robots with Fuel Constraints in Winds
inferred← citeshttps://doi.org/10.1007/978-3-319-28872-7_2openalex-snapshot
Optimal Control of Nonlinear Systems with Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1016/j.conengprac.2023.105600openalex-snapshot
Optimal multi-robot path planning for cyclic tasks using Petri nets
inferred← citeshttps://doi.org/10.1016/j.nahs.2016.02.002openalex-snapshot
Finite abstractions with robustness margins for temporal logic-based control synthesis
inferred← citeshttps://doi.org/10.1109/access.2023.3257185openalex-snapshot
Learning-Based Path Planning Under Co-Safe Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/access.2024.3351893openalex-snapshot
Deep Learning-Based Path Planning Under Co-Safe Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/access.2024.3392289openalex-snapshot
End-to-End Path Planning Under Linear Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760371openalex-snapshot
Optimal control of non-deterministic systems for a computationally efficient fragment of temporal logic
inferred← citeshttps://doi.org/10.1109/cdc.2015.7403398openalex-snapshot
Optimal control in Markov decision processes via distributed optimization
inferred← citeshttps://doi.org/10.1109/cdc.2016.7799413openalex-snapshot
Symbolic synthesis with average performance guarantees
inferred← citeshttps://doi.org/10.1109/icra.2013.6631357openalex-snapshot
Improving the continuous execution of reactive LTL-based controllers
inferred← citeshttps://doi.org/10.1109/icra.2019.8794209openalex-snapshot
Optimal Path Planning for ω-regular Objectives with Abstraction-Refinement
inferred← citeshttps://doi.org/10.1109/iros.2013.6697048openalex-snapshot
Shortcut through an evil door: Optimality of correct-by-construction controllers in adversarial environments
inferred← citeshttps://doi.org/10.1109/iros.2014.6942756openalex-snapshot
Optimal and dynamic planning for Markov decision processes with co-safe LTL specifications
inferred← citeshttps://doi.org/10.1109/iros.2015.7354078openalex-snapshot
Correct-by-synthesis reinforcement learning with temporal logic constraints
inferred← citeshttps://doi.org/10.1109/lra.2017.2727514openalex-snapshot
Cost-Aware Path Planning Under Co-Safe Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/mcs.2016.2643259openalex-snapshot
Formal Methods for Control of Traffic Flow: Automated Control Synthesis from Finite-State Transition Models
inferred← citeshttps://doi.org/10.1109/tac.2014.2381451openalex-snapshot
Optimal Temporal Logic Control for Deterministic Transition Systems With Probabilistic Penalties
inferred← citeshttps://doi.org/10.1109/tro.2015.2414134openalex-snapshot
Timing Semantics for Abstraction and Execution of Synthesized High-Level Robot Control
inferred← citeshttps://doi.org/10.1142/s2301385013500027openalex-snapshot
Synthesis of Control Protocols for Autonomous Systems
inferred← citeshttps://doi.org/10.1142/s2301385014300029openalex-snapshot
Mission Accomplished: An Introduction to Formal Methods in Mobile Robot Motion Planning and Control
inferred← citeshttps://doi.org/10.1146/annurev-control-053018-023717openalex-snapshot
Formal Methods for Control Synthesis: An Optimization Perspective
inferred← citeshttps://doi.org/10.1177/0278364915595278openalex-snapshot
Online task planning and control for fuel-constrained aerial robots in wind fields
inferred← citeshttps://doi.org/10.15607/rss.2014.x.039openalex-snapshot
Probably Approximately Correct MDP Learning and Control With Temporal Logic Constraints
inferred← citeshttps://doi.org/10.24963/ijcai.2017/426openalex-snapshot
Learning from Demonstrations with High-Level Side Information
inferred← citeshttps://doi.org/10.3233/aic-150682openalex-snapshot
Motion planning with temporal-logic specifications: Progress and challenges
inferred← citeshttps://doi.org/10.3390/electronics13132437openalex-snapshot
Mission-Conditioned Path Planning with Transformer Variational Autoencoder
inferred← citeshttps://doi.org/10.3390/s24102998openalex-snapshot
Deep Learning-Enhanced Sampling-Based Path Planning for LTL Mission Specifications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.