Source author record

Jiamin Zhu

Jiamin Zhu appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

6works
5topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

6 published item(s)

preprint2026arXiv

Structural Equivalence and Learning Dynamics in Delayed MARL

We formally establish the equivalence between Observation Delay (OD) and Action Delay (AD) in cooperative partially observable multi-agent systems using observation-action histories. We show that both systems generate identical admissible joint-policy sets, and their induced state-action-observation trajectories are identical in distribution, leading to identical optimal solutions in Decentralized Partially Observable Markov Decision Processes (Dec-POMDPs). This formally generalizes existing infinite-horizon single-agent results to any-horizon partially observable cooperative multi-agent problems with decentralized policy execution, and allows any mixed-delay configuration to be reduced to a pure OD system. We further prove that in Transition-Independent MDPs (TI-MDPs), the observation-action history reduces to a tractable minimal local augmented state. However, we show through numerical experiments that although the optimal solution spaces are structurally isomorphic, the practical learning dynamics are fundamentally different. First, using the minimal local augmented state, the equivalence no longer holds when transitions are not independent. Second, operational constraints and causal credit-assignment errors in Temporal Difference (TD) algorithms induce different learning behaviors across regimes. Finally, leveraging this structural equivalence to bypass these learning challenges, we demonstrate successful multi-agent zero-shot policy transfer from OD to AD, paving the way for unified, efficient solution methods in complex delayed systems.

preprint2022arXiv

Deep learning-based person re-identification methods: A survey and outlook of recent works

In recent years, with the increasing demand for public safety and the rapid development of intelligent surveillance networks, person re-identification (Re-ID) has become one of the hot research topics in the computer vision field. The main research goal of person Re-ID is to retrieve persons with the same identity from different cameras. However, traditional person Re-ID methods require manual marking of person targets, which consumes a lot of labor cost. With the widespread application of deep neural networks, many deep learning-based person Re-ID methods have emerged. Therefore, this paper is to facilitate researchers to understand the latest research results and the future trends in the field. Firstly, we summarize the studies of several recently published person Re-ID surveys and complement the latest research methods to systematically classify deep learning-based person Re-ID methods. Secondly, we propose a multi-dimensional taxonomy that classifies current deep learning-based person Re-ID methods into four categories according to metric and representation learning, including methods for deep metric learning, local feature learning, generative adversarial learning and sequence feature learning. Furthermore, we subdivide the above four categories according to their methodologies and motivations, discussing the advantages and limitations of part subcategories. Finally, we discuss some challenges and possible research directions for person Re-ID.

preprint2019arXiv

Composable and Finite Computational Security of Quantum Message Transmission

Recent research in quantum cryptography has led to the development of schemes that encrypt and authenticate quantum messages with computational security. The security definitions used so far in the literature are asymptotic, game-based, and not known to be composable. We show how to define finite, composable, computational security for secure quantum message transmission. The new definitions do not involve any games or oracles, they are directly operational: a scheme is secure if it transforms an insecure channel and a shared key into an ideal secure channel from Alice to Bob, i.e., one which only allows Eve to block messages and learn their size, but not change them or read them. By modifying the ideal channel to provide Eve with more or less capabilities, one gets an array of different security notions. By design these transformations are composable, resulting in composable security. Crucially, the new definitions are finite. Security does not rely on the asymptotic hardness of a computational problem. Instead, one proves a finite reduction: if an adversary can distinguish the constructed (real) channel from the ideal one (for some fixed security parameters), then she can solve a finite instance of some computational problem. Such a finite statement is needed to make security claims about concrete implementations. We then prove that (slightly modified versions of) protocols proposed in the literature satisfy these composable definitions. And finally, we study the relations between some game-based definitions and our composable ones. In particular, we look at notions of quantum authenticated encryption and QCCA2, and show that they suffer from the same issues as their classical counterparts: they exclude certain protocols which are arguably secure.

preprint2015arXiv

Coupled attitude and trajectory optimization for a launcher tilting maneuver

We study the minimum time control problem of the launchers. The optimal trajectories of the problem may contain singular arcs, and thus chattering arcs. The motion of the launcher is described by its attitude kinematics and dynamics and also by its trajectory dynamics. Based on the nature of the system, we implement an efficient indirect numerical method, combined with numerical continuation, to compute numerically the optimal solutions of the problem. Numerical experiments show the efficiency and the robustness of the proposed method.

preprint2015arXiv

Minimum time control of the rocket attitude reorientation associated with orbit dynamics

In this paper, we investigate the minimal time problem for the guidance of a rocket, whose motion is described by its attitude kinematics and dynamics but also by its orbit dynamics. Our approach is based on a refined geometric study of the extremals coming from the application of the Pontryagin maximum principle. Our analysis reveals the existence of singular arcs of higher-order in the optimal synthesis, causing the occurrence of a chattering phenomenon, i.e., of an infinite number of switchings when trying to connect bang arcs with a singular arc. We establish a general result for bi-input control-affine systems, providing sufficient conditions under which the chattering phenomenon occurs. We show how this result can be applied to the problem of the guidance of the rocket. Based on this preliminary theoretical analysis, we implement efficient direct and indirect numerical methods, combined with numerical continuation, in order to compute numerically the optimal solutions of the problem.

preprint2015arXiv

Planar tilting maneuver of a spacecraft: singular arcs in the minimum time problem and chattering

In this paper, we study the minimum time planar tilting maneuver of a spacecraft, from the theoretical as well as from the numerical point of view, with a particular focus on the chattering phenomenon. We prove that there exist optimal chattering arcs when a singular junction occurs. Our study is based on the Pontryagin Maximum Principle and on results by M.I. Zelikin and V.F. Borisov. We give sufficient conditions on the initial values under which the optimal solutions do not contain any singular arc, and are bang-bang with a finite number of switchings. Moreover, we implement sub-optimal strategies by replacing the chattering control with a fixed number of piecewise constant controls. Numerical simulations illustrate our results.