SearcharxivSearch

arXiv subjects

Samin Moosavi

Publications and source records attributed to Samin Moosavi.

2 recordsLinked to original sources

EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees

LLM-based robot planners are fluent but cannot guarantee that their plans are executable or safe. Classical PDDL planners can guarantee these properties, but only after the problem is fully specified, and they make poor use of an LLM's ability to read context and repair plans. This paper presents a neuro-symbolic framework with three parts. All LLM calls use a locally-hosted open-weight model, so the pipeline can be deployed on-robot with no cloud dependency. First, an offline procedure that mines a single global Signal Temporal Logic (STL) constraint on mobility from demonstration data. The procedure recovers codified rules (e.g., stopping at red lights, mined from nuPlan driving logs) or population preferences (e.g., social-navigation comfort, mined from SCAND teleoperation), depending on what the demonstrations encode. Because the demonstrations are a one-class signal, we generate the missing negatives with counterfactual perturbations and an LLM violation generator and then fit the constraint by evolutionary search. We use the mined constraint to shield a vision-language driving policy on Bench2Drive and two discrete-action navigation policies on HA-VLN-CE. Second, an evolutionary PDDL planner: an LLM proposes and repairs plans, programmatic validators decide which ones survive, and the validated portion of the plan grows over iterations. We test the planner on the open-world ALFWorld Text benchmark, where it beats strong baselines and stays robust when the goal vocabulary does not match the action-model vocabulary. Third, a constrained execution loop: the planner's plan is compiled into waypoints, the waypoints are checked against the mined constraint, and the planner re-plans on a violation. We illustrate the full pipeline via demonstrations using the Gazebo simulator.

cs.RO

A Dynamic Watermarking Technique for Matching Communication Addresses with Cars in a Visual Field

We consider a problem faced by an intelligent roadside unit (RSU) monitoring a roadway by a video camera. Suppose the RSU notices that a particular car in its visual field needs to execute a specific evasive maneuver to avoid danger. It would like to send a packet addressed to that particular car with this suggestion. The problem is that while all the cars are communicating with the RSU, the RSU does not know which car in the video is associated with what IP address. So, it does not know which IP address to send the packet to. Indeed, the problem of matching addresses with cars in the visual field is a fundamental open problem. We provide an active solution employing dynamic watermarking that was originally developed for the security of cyber-physical systems. This technique calls for a car to superpose a small random excitation onto its actuation commands for steering angle or throttle/brake positions. The car sends this random waveform to the RSU in a packet containing its IP address. By signal processing of the video stream of a car at the RSU it can verify whether it matches with the waveform in the packet and thereby associates that the IP address of the packet with that car in the visual field. The RSU thereby determines which IP address is associated with which car in its visual field. We present two demonstrations of performance. We demonstrate experimental results on a laboratory transportation automated vehicles, a vision system, and a network, as well as on the field with two passenger sedans in practice. The results demonstrate that employing the dynamic watermarking method enables an RSU to distinguish the communication of a target vehicle from that of other IP addresses of nearby vehicles.

eess.SP