Searcharxiv⌕ Search

arXiv subjects

Soumya Kanti Ghosh

Publications and source records attributed to Soumya Kanti Ghosh.

2 recordsLinked to original sources

AgentR A Stateful and Recovery-Aware Software Architecture for LLM-based Auditable Workflows

Modern LLM-based applications increasingly require multi- stage execution, persistent intermediate state, retry seman- tics, and auditable usage accounting. However, many LLM applications are still implemented as stateless prompt- response wrappers or session-bounded conversational sys- tems, which makes them difficult to recover, audit, and re- produce after interruption or failure. We propose AgentR, a stateful architecture for LLM workflow systems that en- ables persistence and recovery, instantiated through scien- tific literature review as a representative use case. AgentR represents research intent, generated queries, candidate- paper assessments and gap analyses as durable workflow artifacts, and executes the pipeline through asynchronous BullMQ workers backed by Redis, with PostgreSQL as the persistence store. The design includes explicit processing state transitions, retries with exponential backoff, orphan job detection, credit-aware pre-checks, ACID token-cost logging, and Type-2 slowly changing pricing records. We evaluate AgentR on telemetry collected from a prototype deployment. At the LLM stage, the system achieves 99.2% job completion, and mean latencies of 9.0 s, 18.9 s, and 25.4 s for intent decomposition, query generation, and paper scoring, respectively. Parallel scoring allows for analytical latency modeling from observed calls, leading to as much as 4.3 wall-clock speedup over sequential execution. The results provide preliminary proof-of-concept that persistent state machine design, asynchronous orchestration, and cost-aware usage logging can enable improved observability, recoverability, and operational accountability in LLM workflow systems. The prototype implementation of AgentR is publicly available at: https://github.com/ RiyaSamanta/AgentR-public.

cs.SE↗

Performance assessment of vehicle interdiction strategies in a simulation based environment on a complex transportation network

We consider the escape interdiction problem in a transportation network. In the absence of traffic in the network, the criminal/attacker tries to escape from the city using any of the shortest paths from the crime scene to any randomly chosen exit point. In the presence of traffic, the attacker chooses the optimal path, which takes minimum time to reach his destination. On the contrary, police/defenders try to interdict the criminal on his escape route. This is a challenging task for police with limited resources. Again, a real city road network is also complex in nature. First, we develop a simulation-based model for the optimal allocation of resources using the SUMO simulator. Next, we focus on developing a more advanced search strategy like routing with optimal resource allocation. We develop a novel meta-heuristic approach in a simulation environment to interdict the attacker in a dynamic crime scenario. Like the previous approach, the attacker follows the path with optimal time to escape from the city. In contrast, defenders try to catch the attacker regardless of the path which the attacker takes. The defenders aim is to maximize the interdiction probability. As time plays a vital role, we choose a meta-heuristic approach to provide quality solutions in a time-efficient manner. We test the developed meta-heuristic with a case study on the IIT Kharagpur map, India. We analyze the performance of the mentioned approaches using the SUMO simulator both in the presence of traffic and without traffic. We develop a linear regression model to generate optimal path in the presence of traffic. Here traffic is generated randomly in the whole network using the SUMO simulator.

physics.soc-ph↗