Person

Tyler Summers

Related publications (10)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Tyler Summers

Graph Chatbot

Chat with Graph Search

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Actuator Placement for Optimizing Network Performance under Controllability Constraints

Performance guarantees for greedy maximization of non-submodular controllability metrics

The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes

On infinite dimensional linear programming approach to stochastic control * *This research is partially supported by M. Kamgarpour’s European Union ERC Starting Grant, CONENE and by T. Summers’ the US National Science Foundation under grant CNS-1566127.

Information Structure Design in Team Decision Problems

Upper bounds for the reach-avoid probability via robust optimization

Approximate dynamic programming via sum of squares programming

Approximate dynamic programming for stochastic reachability

Computational Aspects of Distributed Optimization in Model Predictive Control