Itsuki Noda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Itsuki Noda has a total of 156 co-authors. Here are the top co-authors by number of shared publications:
- Hiroki Sakaji
Hokkaido University
12 shared publications - Satoshi Tadokoro
Tohoku University
6 shared publications - Fumitoshi Matsuno
Osaka Institute of Technology, Osaka, Japan
5 shared publications - Taisei Hirayama
Hokkaido University
5 shared publications Ai Sekizawa
3 shared publications- Akira Ohgai
Toyohashi University of Technology
3 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7196-7201
Query-Adaptive Statutory Evidence Construction for Statutory Question Answering
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7196-7201
Open AccessQuery-Adaptive Statutory Evidence Construction for Statutory Question Answering
- 17 October 2026
- Published by Springer Nature
- p. 365-376
Evaluating Priority Dispatch for Premium Membership in On-Demand Taxi-Sharing
- 17 October 2026
- Published by Springer Nature
- p. 365-376
Evaluating Priority Dispatch for Premium Membership in On-Demand Taxi-Sharing
- Open Access
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (10) , 12072-12079
Detour-Delta Task Assignment for Reservation-Based Online MAPD
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (10) , 12072-12079
Open AccessDetour-Delta Task Assignment for Reservation-Based Online MAPD
- Open Access
SL-LDA: LDA-Based Storage Location Assignment for Automated Warehouses Under MAPD Constraints
Storage location assignment in automated warehouses strongly affects order-processing efficiency. Existing co-occurrence-based approaches often rely on pointwise mutual information (PMI) statistics or direct frequency co-occurrence. This paper compares two deliberately chosen representation families for storage assignment in automated warehouses operated under Multi-Agent Pickup and Delivery (MAPD) constraints: Pointwise Positive PMI (PPPMI), representing direct pairwise co-occurrence, and Latent Dirichlet Allocation (LDA), representing latent-topic smoothing. The purpose is not to benchmark every possible representation space, but to make the pairwise-versus-latent contrast interpretable under a fixed execution pipeline consisting of task construction, visit-order selection, path planning, and collision avoidance. The broader research setting is motivated by real warehouse order data in which SKU co-occurrence structure is present, but such logs mix latent-topic effects, explicit family-based co-occurrence, noise, and demand variation. We therefore use two controlled abstractions of order structure: one generator with latent-topic mixtures and one generator with more direct family co-occurrence. We embed the proposed LDA representation and the PPPMI baseline in constrained-clustering and simulated-annealing placement methods and evaluate them against frequency-based, load-balancing, and random baselines. Evaluation is conducted in a fixed extended MAPD simulator that explicitly models orientation-aware motion, turning costs, service times, dynamic task release, and collision avoidance. In the latent-topic regime, LDA-based methods tended to form the leading group in average finite-horizon makespan, computed over completed combinations of random seeds and operating conditions. In the supplementary direct-co-occurrence condition, PPPMI was competitive in the plain representation comparison, while LDA-driven local search on top of a frequency-based initial layout remained strong. These results do not imply that LDA is universally superior; rather, they indicate that the relative suitability of PPPMI and LDA depends on the order structure and on how the representation interacts with the placement optimizer. The controlled generators are useful for isolating those effects, but they do not replace external validation on real warehouse logs.
Open AccessSL-LDA: LDA-Based Storage Location Assignment for Automated Warehouses Under MAPD Constraints
Storage location assignment in automated warehouses strongly affects order-processing efficiency. Existing co-occurrence-based approaches often rely on pointwise mutual information (PMI) statistics or direct frequency co-occurrence. This paper compares two deliberately chosen representation families for storage assignment in automated warehouses operated under Multi-Agent Pickup and Delivery (MAPD) constraints: Pointwise Positive PMI (PPPMI), representing direct pairwise co-occurrence, and Latent Dirichlet Allocation (LDA), representing latent-topic smoothing. The purpose is not to benchmark every possible representation space, but to make the pairwise-versus-latent contrast interpretable under a fixed execution pipeline consisting of task construction, visit-order selection, path planning, and collision avoidance. The broader research setting is motivated by real warehouse order data in which SKU co-occurrence structure is present, but such logs mix latent-topic effects, explicit family-based co-occurrence, noise, and demand variation. We therefore use two controlled abstractions of order structure: one generator with latent-topic mixtures and one generator with more direct family co-occurrence. We embed the proposed LDA representation and the PPPMI baseline in constrained-clustering and simulated-annealing placement methods and evaluate them against frequency-based, load-balancing, and random baselines. Evaluation is conducted in a fixed extended MAPD simulator that explicitly models orientation-aware motion, turning costs, service times, dynamic task release, and collision avoidance. In the latent-topic regime, LDA-based methods tended to form the leading group in average finite-horizon makespan, computed over completed combinations of random seeds and operating conditions. In the supplementary direct-co-occurrence condition, PPPMI was competitive in the plain representation comparison, while LDA-driven local search on top of a frequency-based initial layout remained strong. These results do not imply that LDA is universally superior; rather, they indicate that the relative suitability of PPPMI and LDA depends on the order structure and on how the representation interacts with the placement optimizer. The controlled generators are useful for isolating those effects, but they do not replace external validation on real warehouse logs.
- Open Access
Deliberate Assignment Deferral for Multi-Agent Pickup and Delivery with Deadlines
Automated warehouses must coordinate fleets of mobile robots online while meeting order deadlines. In online Multi-Agent Pickup and Delivery with Deadlines (MAPD-D), committing to a feasible task immediately may restrict flexibility and increase downstream tardiness through congestion and reservation interactions. We propose Deliberate Assignment Deferral (DAD-), a one-parameter gate on top of deadline-aware Token Passing baselines (D-TP and D-TPTS). At each token turn, the token holder evaluates the baseline-defined assignable tasks using the baseline score (lower is better); it commits only if the best score is at most , and otherwise follows the baseline fallback. A safety override forces assignment once any assignable task reaches non-positive pickup slack. We also introduce a scale-normalized score that makes dimensionless for transfer across maps and deadline scales. In 100-seed paired simulations across four arrival/deadline regimes on a benchmark map, scenario-calibrated DAD- reduces cumulative tardiness by 9–58% and increases on-time completion by 1.3–10.0 percentage points relative to always-assign. We discuss how can be calibrated offline in a digital twin and monitored online via deferral and safety-trigger rates for service-level control.Open AccessDeliberate Assignment Deferral for Multi-Agent Pickup and Delivery with Deadlines
Automated warehouses must coordinate fleets of mobile robots online while meeting order deadlines. In online Multi-Agent Pickup and Delivery with Deadlines (MAPD-D), committing to a feasible task immediately may restrict flexibility and increase downstream tardiness through congestion and reservation interactions. We propose Deliberate Assignment Deferral (DAD-), a one-parameter gate on top of deadline-aware Token Passing baselines (D-TP and D-TPTS). At each token turn, the token holder evaluates the baseline-defined assignable tasks using the baseline score (lower is better); it commits only if the best score is at most , and otherwise follows the baseline fallback. A safety override forces assignment once any assignable task reaches non-positive pickup slack. We also introduce a scale-normalized score that makes dimensionless for transfer across maps and deadline scales. In 100-seed paired simulations across four arrival/deadline regimes on a benchmark map, scenario-calibrated DAD- reduces cumulative tardiness by 9–58% and increases on-time completion by 1.3–10.0 percentage points relative to always-assign. We discuss how can be calibrated offline in a digital twin and monitored online via deferral and safety-trigger rates for service-level control. - Open Access
- 5 February 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (1) , 11
Positive-unlabeled learning for training an entanglement detector
Entanglement detection, the process of verifying quantum entanglement is a fundamental challenge in quantum information processing. Various approaches have been proposed to address this challenge, with many recent studies applying supervised machine learning methods. While these methods have demonstrated high accuracy in entanglement detection, it is reasonable to assume that the entangled states themselves are not definitively known. To address this limitation, we have devised a machine learning method for entanglement detection based on positive-unlabeled learning, a classical machine learning framework that does not use label information from negative data. Using a deep neural network model to synthetic dataset under the assumption of mixed states, we conducted experiments on a classical computer to valid the effectiveness and characteristics of the proposed method. Our approach introduces a novel framework that accounts for the data generation constraints in the training process of entanglement detector, thereby advancing machine learning techniques in quantum information science.
- 5 February 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (1) , 11
Open AccessPositive-unlabeled learning for training an entanglement detector
Entanglement detection, the process of verifying quantum entanglement is a fundamental challenge in quantum information processing. Various approaches have been proposed to address this challenge, with many recent studies applying supervised machine learning methods. While these methods have demonstrated high accuracy in entanglement detection, it is reasonable to assume that the entangled states themselves are not definitively known. To address this limitation, we have devised a machine learning method for entanglement detection based on positive-unlabeled learning, a classical machine learning framework that does not use label information from negative data. Using a deep neural network model to synthetic dataset under the assumption of mixed states, we conducted experiments on a classical computer to valid the effectiveness and characteristics of the proposed method. Our approach introduces a novel framework that accounts for the data generation constraints in the training process of entanglement detector, thereby advancing machine learning techniques in quantum information science.
- 24 November 2025
- Published by Springer Nature
- p. 191-202
LDAS: Proposal for Semi-optimal Storage Locations Using LDA and SA
- 24 November 2025
- Published by Springer Nature
- p. 191-202
LDAS: Proposal for Semi-optimal Storage Locations Using LDA and SA
- 24 November 2025
- Published by Springer Nature
- p. 166-178
Efficient Assignment of Immediate Tasks Using Deep Reinforcement Learning in Multi-Agent Pickup and Delivery
- 24 November 2025
- Published by Springer Nature
- p. 166-178
Efficient Assignment of Immediate Tasks Using Deep Reinforcement Learning in Multi-Agent Pickup and Delivery
- 16 April 2025
- Published by Springer Nature
- p. 70-86
Optimal Assignment of Immediate Tasks in Multi-agent Pickup and Delivery
- 16 April 2025
- Published by Springer Nature
- p. 70-86
Optimal Assignment of Immediate Tasks in Multi-agent Pickup and Delivery