1 resultado para Incremental Clustering
em CaltechTHESIS
Filtro por publicador
- Repository Napier (2)
- ABACUS. Repositorio de Producción Científica - Universidad Europea (1)
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (5)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (5)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (12)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (39)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (11)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (12)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (37)
- Boston University Digital Common (7)
- Brock University, Canada (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (7)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (85)
- CentAUR: Central Archive University of Reading - UK (67)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (17)
- Cochin University of Science & Technology (CUSAT), India (4)
- Collection Of Biostatistics Research Archive (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (2)
- Deakin Research Online - Australia (153)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (2)
- DigitalCommons@The Texas Medical Center (5)
- DigitalCommons@University of Nebraska - Lincoln (3)
- Duke University (2)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (5)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (74)
- Infoteca EMBRAPA (1)
- Instituto Gulbenkian de Ciência (1)
- Instituto Nacional de Saúde de Portugal (1)
- Instituto Politécnico de Viseu (2)
- Instituto Politécnico do Porto, Portugal (7)
- Instituto Superior de Psicologia Aplicada - Lisboa (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (13)
- Nottingham eTheses (1)
- Open University Netherlands (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (15)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (47)
- Queensland University of Technology - ePrints Archive (98)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (2)
- Repositório Científico da Universidade de Évora - Portugal (3)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (5)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositorio Institucional de la Universidad de Almería (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (50)
- Research Open Access Repository of the University of East London. (4)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- School of Medicine, Washington University, United States (1)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad de Alicante (6)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (26)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universitat de Girona, Spain (8)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (3)
- University of Canberra Research Repository - Australia (1)
- University of Michigan (10)
- University of Queensland eSpace - Australia (31)
- WestminsterResearch - UK (1)
Resumo:
This thesis presents methods for incrementally constructing controllers in the presence of uncertainty and nonlinear dynamics. The basic setting is motion planning subject to temporal logic specifications. Broadly, two categories of problems are treated. The first is reactive formal synthesis when so-called discrete abstractions are available. The fragment of linear-time temporal logic (LTL) known as GR(1) is used to express assumptions about an adversarial environment and requirements of the controller. Two problems of changes to a specification are posed that concern the two major aspects of GR(1): safety and liveness. Algorithms providing incremental updates to strategies are presented as solutions. In support of these, an annotation of strategies is developed that facilitates repeated modifications. A variety of properties are proven about it, including necessity of existence and sufficiency for a strategy to be winning. The second category of problems considered is non-reactive (open-loop) synthesis in the absence of a discrete abstraction. Instead, the presented stochastic optimization methods directly construct a control input sequence that achieves low cost and satisfies a LTL formula. Several relaxations are considered as heuristics to address the rarity of sampling trajectories that satisfy an LTL formula and demonstrated to improve convergence rates for Dubins car and single-integrators subject to a recurrence task.