Results 61 to 70 of about 12,408,035 (295)

Scalable Task Planning via Large Language Models and Structured World Representations

open access: yesAdvanced Robotics Research, EarlyView.
This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari   +4 more
wiley   +1 more source

Bisimulations for delayed switched Boolean control networks and its application in controllability

open access: yesIET Control Theory & Applications, 2023
This paper investigates bisimulation relations of delayed switched Boolean control networks (DSBCNs), using the semi‐tensor product (STP) approach. Firstly, the notion of bisimulation in DSBCNs is formalized. Subsequently, based on the skeleton matrix of
Weiyong Yu   +3 more
doaj   +1 more source

Stabilization of random Boolean networks

open access: yes, 2010
This paper considers the stabilization of random Boolean networks. We first give a survey on the semi-tensor product approach to Boolean (control) networks, which is a new technique developed by us.
null Xiaoming Hu   +5 more
core   +1 more source

Multimodal Human–Robot Interaction Using Human Pose Estimation and Local Large Language Models

open access: yesAdvanced Robotics Research, EarlyView.
A multimodal human–robot interaction framework integrates human pose estimation (HPE) and a large language model (LLM) for gesture‐ and voice‐based robot control. Speech‐to‐text (STT) enables voice command interpretation, while a safety‐aware arbitration mechanism prioritizes gesture input for rapid intervention.
Nasiru Aboki   +2 more
wiley   +1 more source

Observability and reconstructibility of Boolean control networks

open access: yes, 2012
In this paper we address observability and reconstructibility of Boolean networks and of Boolean control networks. By resorting to the algebraic approach recently introduced by D.
Maria Elena Valcher   +3 more
core   +1 more source

DRIVE‐SAFE: Data‐Driven Robustness and Informed Validation for Evolving Specifications via Formal Evaluation

open access: yesAdvanced Robotics Research, EarlyView.
DRIVE‐SAFE evaluates learning‐based, black‐box autonomous driving policies against evolving temporal safety requirements using Signal Temporal Logic robustness metrics. It aggregates distributional robustness measures with domain‐informed weights to guide iterative retraining.
Kristy Sakano   +3 more
wiley   +1 more source

Ferroelectric Devices for In‐Memory and In‐Sensor Computing

open access: yesAdvanced Science, EarlyView.
Inspired by biological systems, in‐memory and in‐sensor computing overcome von Neumann bottlenecks. Ferroelectric devices can mimic synaptic functions and sense stimuli like light or force, therefore are ideal for these paradigms. This review introduces the ferroelectric devices applied for in‐memory and in‐sensor computing, covering their structures ...
Hong Fang   +5 more
wiley   +1 more source

Finite-Time Controllability and Set Controllability of Impulsive Probabilistic Boolean Control Networks

open access: yesIEEE Access, 2020
This paper addresses the finite-time controllability and set controllability of impulsive probabilistic Boolean control networks (IPBCNs). Firstly, using the algebraic state space representation (ASSR) method, the transition probability matrix of IPBCNs ...
Jing Wang, Yansheng Liu, Haitao Li
doaj   +1 more source

A Generative Neuro‐Symbolic AI for Protein Sequence Design

open access: yesAdvanced Science, EarlyView.
We introduce EffieDes, a neuro‐symbolic framework coupling deep learning‐based fitness landscape parameterization with exact automated reasoning. Unlike greedy sampling, EffieDes identifies sequences that globally optimize fitness while satisfying intricate design constraints.
Marianne Defresne   +12 more
wiley   +1 more source

Finite-time observability of probabilistic Boolean multiplex control networks [PDF]

open access: yes
summary:This paper investigates the finite-time observability of probabilistic Boolean multiplex control networks (PBMCNs). Firstly, the finite-time observability of the PBMCNs is converted into the set reachability issue according to the parallel ...
Cui, Yuxin, Shan, Yunxiao, Li, Shu
core   +1 more source

Home - About - Disclaimer - Privacy