Arrow Research search

Author name cluster

Haitao Wang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

23 papers
2 author rows

Possible papers

23

AAAI Conference 2026 Conference Paper

D²PPO: Diffusion Policy Policy Optimization with Dispersive Loss

  • Guowei Zou
  • Weibing Li
  • Hejun Wu
  • Yukun Qian
  • Yuhang Wang
  • Haitao Wang

Diffusion policies excel at robotic manipulation by naturally modeling multimodal action distributions in high-dimensional spaces. Nevertheless, diffusion policies suffer from diffusion representation collapse: semantically similar observations are mapped to indistinguishable features, ultimately impairing their ability to handle subtle but critical variations required for complex robotic manipulation. To address this problem, we propose D²PPO (Diffusion Policy Policy Optimization with Dispersive Loss). D²PPO introduces dispersive loss regularization that combats representation collapse by treating all hidden representations within each batch as negative pairs. D²PPO compels the network to learn discriminative representations of similar observations, thereby enabling the policy to identify subtle yet crucial differences necessary for precise manipulation. In evaluation, we find that early-layer regularization benefits simple tasks, while late-layer regularization sharply enhances performance on complex manipulation tasks. On RoboMimic benchmarks, D²PPO achieves an average improvement of 22.7% in pre-training and 26.1% after fine-tuning, setting new SOTA results. In comparison with SOTA, the results of real-world experiments on a Franka Emika Panda robot show the excitingly high success rate of our method. The superiority of our method is especially evident in complex tasks.

EAAI Journal 2026 Journal Article

Variational inference for learning-based orbital pursuit-evasion under incomplete information

  • Junhua He
  • Hua Wang
  • Haitao Wang
  • Chengyi Huo
  • Heng Jing

Observation is a key factor influencing the strategy design of orbital games. This paper focuses on the orbital pursuit-evasion game with observation errors and information delays (ED-OPEG), proposing an artificial intelligence-based autonomous decision-making method. The game model for ED-OPEG is built based on orbital dynamics and game theory, and is further reconstructed under the partially observable Markov decision process framework—decomposing the game strategy solution into belief state inference and strategy mapping. Accordingly, the Histories-Enhanced Variational Twin Delay Deep Deterministic policy gradient (HE-VTD3) algorithm is proposed. Simulation experiments demonstrate that the HE-VTD3 algorithm exhibits strong resistance to local convergence while ensuring training stability. Against target adopting adversarial strategies, HE-VTD3 enables the pursuer to achieve a capture success rate of 80. 4%, showing improvements of 20. 2% and 67. 1% over the long-short-term-memory-based twin delayed deep deterministic policy gradient and delayed turn-based multi-agent deep deterministic policy gradient algorithms, respectively. Under the multivariate 95% confidence ellipse, HE-VTD3's empirical confidence level for non-cooperative target state uncertainty estimation reaches 97. 77%. Generalization analysis further confirms that HE-VTD3 exhibits robustness to environmental uncertainties and disturbances.

EAAI Journal 2025 Journal Article

An effective convolutional and transformer cooperation network for underwater acoustic target recognition

  • Anqi Jin
  • Shuang Yang
  • Menghui Lei
  • Xiangyang Zeng
  • Haitao Wang

Underwater acoustic target recognition (UATR) is a key technology in the field of underwater acoustic information processing. In recent years, models based on convolutional neural networks (CNN) have shown excellent performance in the domain of UATR. However, CNN have limitations in capturing the global information of underwater acoustic features. Due to its advantages in modeling global dependencies, the Transformer model is gradually gaining attention from researchers. In order to capture the time-frequency dependencies in acoustic spectrograms more effectively, this paper proposes a recognition model based on the Mel spectrogram that combines CNN with the Transformer, named the underwater acoustics CNN-Transformer cooperation network (UACTC). Compared to the Transformer alone, this model is more efficient in extracting local features. The CNN module uses a residual network based on the efficient channel attention (ECA) module for efficient deep feature extraction. Additionally, the ECA module is introduced into the Transformer block to enhance the channel feature extraction of the Transformer. Experiments prove that the ECA module effectively improves the performance of the recognition system. The effectiveness of the proposed model has been validated on two public datasets, achieving 98. 05 % and 96. 96 % on the ShipsEar and DeepShip datasets, respectively.

IJCAI Conference 2025 Conference Paper

Asynchronous Credit Assignment for Multi-Agent Reinforcement Learning

  • Yongheng Liang
  • Hejun Wu
  • Haitao Wang
  • Hao Cai

Credit assignment is a critical problem in multi-agent reinforcement learning (MARL), aiming to identify agents' marginal contributions for optimizing cooperative policies. Current credit assignment methods typically assume synchronous decision-making among agents. However, many real-world scenarios require agents to act asynchronously without waiting for others. This asynchrony introduces conditional dependencies between actions, which pose great challenges to current methods. To address this issue, we propose an asynchronous credit assignment framework, incorporating a Virtual Synchrony Proxy (VSP) mechanism and a Multiplicative Value Decomposition (MVD) algorithm. VSP enables physically asynchronous actions to be virtually synchronized during credit assignment. We theoretically prove that VSP preserves both task equilibrium and algorithm convergence. Furthermore, MVD leverages multiplicative interactions to effectively model dependencies among asynchronous actions, offering theoretical advantages in handling asynchronous tasks. Extensive experiments show that our framework consistently outperforms state-of-the-art MARL methods on challenging tasks while providing improved interpretability for asynchronous cooperation.

IJCAI Conference 2025 Conference Paper

DisPIM: Distilling PreTrained Image Models for Generalizable Visuo-Motor Control

  • Haitao Wang
  • Hejun Wu

We introduce DisPIM, a framework that leverages pretrained image models (PIMs) for visuo-motor control. Applying PIMs to visuo-motor control faces a big difficulty due to the distribution shift between the distribution of visual environmental states and that of the pretraining datasets. Due to such a distribution shift, fine-tuning PIMs specifically for visuo-motor control may hurt the generalizability of PIMs, while adding additional tunable parameters for specific actions apparently lead to high computational costs. DisPIM addresses these challenges using a novel feature distillation approach, which obtains a compact model that not only inherit the generalization capability of PIMs but also acquire task-specific skills for visuo-motor control. This good for both sides is mainly achieved by means of a target Q-ensemble mechanism, which is inspired by double Q-learning. This Q-ensemble mechanism can adaptively adjust the distillation rate, so as to balance the objective of generalization and task-specific ability during training. With this balancing mechanism, DisPIM achieves both task-specific and generalizable control requiring a low computation cost. Across a series of algorithms, task domains, and evaluation metrics in both simulation and real robot, our DisPIM demonstrates significant improvements in generalization and overall performance with low computational overhead.

IROS Conference 2025 Conference Paper

GIPD: Global Intent Prediction and Decomposition of Cooperative Multi-Robot System in Non-Communication Environments

  • Yu Zhao
  • Zhe Liu
  • Haoyu Wei
  • Kai Wang
  • Haitao Wang
  • Duwen Zhai
  • Kefan Jin
  • Haibin Shao

In complex multi-robot application scenarios, particularly in dynamically adversarial, hazardous, or disaster environments, traditional cooperation paradigms face significant challenges due to unreliable or absent communication links. Achieving efficient cooperation in the absence of communication has become a key bottleneck limiting the performance of multirobot systems. In this paper, we propose a Global Intent Prediction and Decomposition (GIPD) framework that enables robots to perform cooperative behavior without relying on communication. Each robot independently infers a globally consistent intent based solely on its local observations, ensuring implicit alignment across the system. Given the inferred global intent, robots autonomously determine their responsibilities and select the most appropriate tasks. They then base their local decision-making on the global intent, selected tasks, and individual observations, thereby facilitating effective execution and cooperation. We validate our approach using the MPE and SMAC benchmarks. Additionally, real-world experiments involving multiple ships demonstrate the effectiveness and practical applicability of the proposed GIPD method.

ICRA Conference 2025 Conference Paper

TDFANet: Encoding Sequential 4D Radar Point Clouds Using Trajectory-Guided Deformable Feature Aggregation for Place Recognition

  • Shouyi Lu
  • Guirong Zhuo
  • Haitao Wang
  • Quan Zhou
  • Huanyu Zhou
  • Renbo Huang
  • Minqing Huang
  • Lianqing Zheng

Place recognition is essential for achieving closedloop or global positioning in autonomous vehicles and mobile robots. Despite recent advancements in place recognition using 2D cameras or 3D LiDAR, it remains to be seen how to use 4D radar for place recognition - an increasingly popular sensor for its robustness against adverse weather and lighting conditions. Compared to LiDAR point clouds, radar data are drastically sparser, noisier and in much lower resolution, which hampers their ability to effectively represent scenes, posing significant challenges for 4D radar-based place recognition. This work addresses these challenges by leveraging multimodal information from sequential 4D radar scans and effectively extracting and aggregating spatio-temporal features. Our approach follows a principled pipeline that comprises (1) dynamic points removal and ego-velocity estimation from velocity property, (2) bird's eye view (BEV) feature encoding on the refined point cloud, (3) feature alignment using BEV feature map motion trajectory calculated by ego-velocity, (4) multiscale spatio-temporal features of the aligned BEV feature maps are extracted and aggregated. Real-world experimental results validate the feasibility of the proposed method and demonstrate its robustness in handling dynamic environments. Source codes are available.

AAAI Conference 2025 Conference Paper

VisRec: A Semi-Supervised Approach to Visibility Data Reconstruction in Radio Astronomy

  • Ruoqi Wang
  • Haitao Wang
  • Qiong Luo
  • Feng Wang
  • Hejun Wu

Radio telescopes produce visibility data about celestial objects, but these data are sparse and noisy. As a result, images created on raw visibility data are of low quality. Recent studies have used deep learning models to reconstruct visibility data to get cleaner images. However, these methods rely on a substantial amount of labeled training data, which requires significant labeling effort from radio astronomers. Addressing this challenge, we propose VisRec, a model-agnostic semi-supervised learning approach to visibility data reconstruction in radio astronomy. Specifically, VisRec consists of both a supervised learning module and an unsupervised learning module. In the supervised learning module, we introduce a set of data augmentation functions to produce diverse visibility examples. In comparison, the unsupervised learning module in VisRec augments unlabeled data and uses reconstructions from non-augmented visibility as pseudo-labels for training. This hybrid approach allows VisRec to effectively leverage both labeled and unlabeled data. This way, VisRec performs well even when labeled data is scarce. Our evaluation results show that VisRec is applicable to various models, and outperforms all baseline methods in terms of reconstruction quality, robustness, and generalizability.

EAAI Journal 2024 Journal Article

Data-driven hierarchical learning approach for multi-point servo control of Pan–Tilt–Zoom cameras

  • Haitao Wang
  • XiangShuai Zhai
  • Tao Wen
  • ZiDu Yin
  • Yang Yang

Pan–Tilt–Zoom (PTZ) cameras, with their significant features of free rotation and zoom, are widely used in areas such as border security, ecological conservation, emergency management, and the military. PTZ cameras can achieve automatic monitoring of a selected area through multiple servo operations, known as multi-point servo control. However, due to the deficiencies in the servo control Software Development Kit (SDK), hardware wear, and interference from complex external environments, the multi-point servo control process generates significant errors. This paper proposes a precise multi-point servo control framework based on Deep Reinforcement Learning (DRL) to address this issue. The complexity of real-world environments necessitates a reward function design that fully considers various factors, for which we propose the directional gravity reward function. Due to the instability during the training process, prolonged trial-and-error interactions between the agent and the equipment can cause irreversible damage to the devices. This framework employs a phased training approach, where the agent learns sequentially from offline, off-policy, and on-policy data, reducing direct interaction with the equipment while enhancing the agent’s overall performance. Additionally, real-time and accurate device status can be obtained by performing feature matching on images from adjacent time frames, which is crucial for the system’s operation. Evaluation results indicate that our proposed precise multi-point servo control framework significantly outperforms other methods in 4-point servo control tasks in both virtual and real-world scenarios. Additionally, the operational process fully considers safety issues.

EAAI Journal 2024 Journal Article

Underwater acoustic target recognition based on sub-band concatenated Mel spectrogram and multidomain attention mechanism

  • Shuang Yang
  • Anqi Jin
  • Xiangyang Zeng
  • Haitao Wang
  • Xi Hong
  • Menghui Lei

Underwater acoustic target recognition is extremely challenging because of the pronounced background noise and intricate sound propagation patterns inherent to maritime environments. Herein, we propose a sub-band concatenated Mel spectrogram to amplify low-frequency ship-radiated noise. This method enhances features through multispectrogram concatenation. Furthermore, we introduce a multidomain attention mechanism to enhance the performance of a simple residual network to develop a lightweight CFTANet model. The recognition accuracies of the recognition system are 90. 60% and 96. 40% on two open datasets. On the DeepShip dataset, the recognition accuracy is 7. 06% higher than those of previous state-of-the-art methods.

IROS Conference 2022 Conference Paper

An Adaptive Approach to Whole-Body Balance Control of Wheel-Bipedal Robot Ollie

  • Jingfan Zhang
  • Shuai Wang 0007
  • Haitao Wang
  • Jie Lai
  • Zhenshan Bing
  • Yu Jiang
  • Yu Zheng 0001
  • Zhengyou Zhang

The wheel-bipedal robot has the advantages of both wheeled robots and legged robots, but as a cost, it is more challenging to perform flexible movements in various surroundings while keeping it balanced. The inaccurate dynamics of the robot makes the balance problem even more intractable. To solve this problem, the robot Ollie is used as a testbed. The whole-body control (WBC) framework is adopted to enhance the dexterity of the robot with multiple degrees of freedom in the task space. Moreover, a learning-based adaptive technique is applied to assist the WBC such that the balance controller can be designed in the absence of the accurate dynamics. Physical experiments demonstrate that the robot can manage various actions, with the help of the combination of the WBC and the learning-based adaptive technique.

AAMAS Conference 2022 Conference Paper

ASM-PPO: Asynchronous and Scalable Multi-Agent PPO for Cooperative Charging

  • Yongheng Liang
  • Hejun Wu
  • Haitao Wang

Wireless Rechargeable Sensor Networks (WRSNs) are especially promising in large-area monitoring tasks that are previously impossible to complete by traditional Wireless Sensor Networks (WSNs). Mobile Chargers (MCs) in WRSNs are to cooperatively charge battery drained sensor nodes high efficiently and with a guarantee of sensors survival. Considering the unpredictability and high dynamics of WRSNs during the charging process, Multi-Agent Reinforcement Learning (MARL) is an attractive alternative to schedule the cooperation among MCs. However, most existing MARL methods are based on Decentralized Partially Observable Markov Decision Processes (Dec-POMDP), a general framework to describe decentralized agents making decisions at the same time step. Nevertheless, MCs in WRSNs perform charging asynchronously since the charging time of each sensor node varies. To address the problem of asynchronous behavior, we first formulate an Asynchronous Dec- POMDP (AD-POMDP). We then propose an algorithm called Asynchronous and Scalable Multi-agent Proximal Policy Optimization (ASM-PPO) that allows asynchronous learning and decision-making in AD-POMDP based on two popular multi-agent reinforcement learning methods in Dec-POMDP. Furthermore, ASM-PPO takes advantage of the translation invariance in WRSNs to avoid the huge input space dimensions caused by centralized training. The evaluation results not only indicate that our method achieves much charging efficiency and the longer lifetime of sensor nodes, but also demonstrate that ASM-PPO has advantages in terms of stability and scalability over existing methods.

TCS Journal 2021 Journal Article

Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees

  • Haitao Wang
  • Yiming Zhao

We consider the problem of computing the diameter of a unicycle graph (i. e. , a graph with a unique cycle). We present an O ( n ) time algorithm for the problem, where n is the number of vertices of the graph. This improves the previous best O ( n log ⁡ n ) time solution [Oh and Ahn, ISAAC 2016]. Using this algorithm as a subroutine, we solve the problem of adding a shortcut to a tree so that the diameter of the new graph (which is a unicycle graph) is minimized; our algorithm takes O ( n 2 log ⁡ n ) time and O ( n ) space. The previous best algorithms solve the problem in O ( n 2 log 3 ⁡ n ) time and O ( n ) space [Oh and Ahn, ISAAC 2016], or in O ( n 2 ) time and O ( n 2 ) space [Bilò, ISAAC 2018].

TCS Journal 2019 Journal Article

Algorithms for covering multiple barriers

  • Shimin Li
  • Haitao Wang

In this paper, we consider the problems for covering multiple intervals on a line. Given a set B of m line segments (called “barriers”) on a horizontal line L and another set S of n horizontal line segments of the same length in the plane, we want to move all segments of S to L so that their union covers all barriers and the maximum movement of all segments of S is minimized. Previously, an O ( n 3 log ⁡ n ) -time algorithm was given for the case m = 1. In this paper, we propose an O ( n 2 log ⁡ n log ⁡ log ⁡ n + n m log ⁡ m ) -time algorithm for a more general setting with any m ≥ 1, which also improves the previous work when m = 1. We then consider a line-constrained version of the problem in which the segments of S are all initially on the line L. Previously, an O ( n log ⁡ n ) -time algorithm was known for the case m = 1. We present an algorithm of O ( m log ⁡ m + n log ⁡ m log ⁡ n ) time for any m ≥ 1. These problems may have applications in mobile sensor barrier coverage in wireless sensor networks.

TCS Journal 2019 Journal Article

L1 shortest path queries in simple polygons

  • Sang Won Bae
  • Haitao Wang

Let P be a simple polygon of n vertices. We consider two-point L 1 shortest path queries in P. We build a data structure of O ( n ) size in O ( n ) time such that given any two query points s and t, the length of an L 1 shortest path from s to t in P can be computed in O ( log ⁡ n ) time, or in O ( 1 ) time if both s and t are vertices of P, and an actual shortest path can be output in additional linear time in the number of edges of the path. To achieve the result, we propose a mountain decomposition of simple polygons, which may be interesting in its own right. Most importantly, our approach is much simpler than the previous work on this problem.

TCS Journal 2018 Journal Article

Near-linear time approximation schemes for geometric maximum coverage

  • Kai Jin
  • Jian Li
  • Haitao Wang
  • Bowei Zhang
  • Ningye Zhang

We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. Let D represent a planar object, such as a rectangle, or a disk. We want to place m copies of D such that the sum of the weights of the points in P covered by these copies is maximized. For any fixed ε > 0, we present efficient approximation schemes that can find a ( 1 − ε ) -approximation to the optimal solution. In particular, for m = 1 and for the special case where D is a rectangle, our algorithm runs in time O ( n log ⁡ ( 1 ε ) ), improving on the previous result. For m > 1 and the rectangular case, our algorithm runs in O ( n ε log ⁡ ( 1 ε ) + m ε log ⁡ m + m ( 1 ε ) O ( min ⁡ ( m, 1 ε ) ) ) time. For a more general class of shapes (including disks, polygons with O ( 1 ) edges), our algorithm runs in O ( n ( 1 ε ) O ( 1 ) + m ϵ log ⁡ m + m ( 1 ε ) O ( min ⁡ ( m, 1 ε 2 ) ) ) time.

TCS Journal 2016 Journal Article

Range queries on uncertain data

  • Jian Li
  • Haitao Wang

Given a set P of n uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures on P to answer range queries of the following three types for any query interval I: (1) top-1 query: find a point in P that lies in I with the highest probability, (2) top-k query: given any integer k ≤ n as part of the query, return the k points in P that lie in I with the highest probabilities, and (3) threshold query: given any threshold τ as part of the query, return all points of P that lie in I with probabilities at least τ. We present data structures for these range queries with linear or nearly linear space and efficient query time.

TCS Journal 2016 Journal Article

Shortest color-spanning intervals

  • Minghui Jiang
  • Haitao Wang

Given a set of n points on a line, where each point has one of k colors, and given an integer s i ≥ 1 for each color i, 1 ≤ i ≤ k, the problem Shortest Color-Spanning t Intervals (SCSI-t) aims at finding t intervals to cover at least s i points of each color i, such that the maximum length of the intervals is minimized. Chen and Misiolek introduced the problem SCSI-1, and presented an algorithm running in O ( n ) time if the input points are sorted. Khanteimouri et al. gave an O ( n 2 log ⁡ n ) time algorithm for the special case of SCSI-2 with s i = 1 for all colors i. In this paper, we present an improved algorithm with running time of O ( n 2 ) for SCSI-2 with arbitrary s i ≥ 1. We also obtain some interesting results for the general problem SCSI-t. From the negative direction, we show that approximating SCSI-t within any ratio is NP-hard when t is part of the input, is W[2]-hard when t is the parameter, and is W[1]-hard with both t and k as parameters. Moreover, the NP-hardness and the W[2]-hardness with parameter t hold even if s i = 1 for all i. From the positive direction, we show that SCSI-t with s i = 1 for all i is fixed-parameter tractable with k as the parameter, and admits an exact algorithm running in O ( 2 k n ⋅ max ⁡ { k, log ⁡ n } ) time.

TCS Journal 2015 Journal Article

Efficient algorithms for the one-dimensional k-center problem

  • Danny Z. Chen
  • Jian Li
  • Haitao Wang

We consider the problem of finding k centers for n weighted points on a real line. This (weighted) k-center problem was solved in O ( n log ⁡ n ) time previously by using Cole's parametric search and other complicated approaches. In this paper, we present an easier O ( n log ⁡ n ) time algorithm that avoids the parametric search, and in certain special cases our algorithm solves the problem in O ( n ) time. In addition, our techniques involve developing interesting data structures for processing queries that find a lowest point in the common intersection of a certain subset of half-planes. This subproblem is interesting in its own right and our solution for it may find other applications as well.

TCS Journal 2015 Journal Article

One-dimensional k-center on uncertain data

  • Haitao Wang
  • Jingru Zhang

Problems on uncertain data have attracted significant attention due to the imprecise nature of many measurement data. In this paper, we consider the k-center problem on one-dimensional uncertain data. The input is a set P of (weighted) uncertain points on a real line, and each uncertain point is specified by its probability density function (pdf) which is a piecewise-uniform function (i. e. , a histogram). The goal is to find a set Q of k points on the line to minimize the maximum expected distance from the uncertain points of P to their expected closest points in Q. We present efficient algorithms for this uncertain k-center problem and their running times almost match those for the “deterministic” k-center problem.

TCS Journal 2015 Journal Article

Quell

  • Minghui Jiang
  • Pedro J. Tejada
  • Haitao Wang

We study the computational complexity of the puzzle Quell. The goal is to collect pearls by sliding a droplet of water over them in a map that is a two-dimensional grid. Each cell of the grid is either a free space (possibly with a pearl in it) or an obstacle. In each move, the droplet slides in one of the four directions to the maximal extent, through the free spaces of the map and collecting all pearls along the way, until it is stopped by an obstacle. We show that any-Moves-all-Pearls (deciding whether it is possible to collect all the pearls using any number of moves) can be solved in polynomial time. In contrast, both any-Moves-max-Pearls (finding the maximum number of pearls that can be collected using any number of moves) and min-Moves-all-Pearls (finding the minimum number of moves required to collect all the pearls) are APX-hard, although the corresponding decision problems are in FPT. We also present a simple 2-approximation for any-Moves-max-Pearls, and leave open the question whether min-Moves-all-Pearls admits a polynomial-time constant approximation.

TCS Journal 2011 Journal Article

Online rectangle filling

  • Haitao Wang
  • Amitabh Chaudhary
  • Danny Z. Chen

We study an online geometric problem arising in channel-aware scheduling of wireless networks, which we call the online rectangle filling. We present an online algorithm (with one-lookahead) for this problem with a competitive ratio of 1. 848, improving the previously best-known 8/3-competitive algorithm in Arora et al. (2006) [4]. We also prove a lower bound of 1. 6358 on the competitive ratio of the problem, improving the previous 1. 6 lower bound in [4]. In addition, we give an O ( n 2 ) -time optimal algorithm for the offline version of the problem, where n is the size of the input, which improves the O ( n 3 ) -time solution in Arora and Choi (2006) [3], Arora et al. (2006) [5]. Our techniques are based on interesting techniques and new observations of the combinatorial structures in the problem.

AIIM Journal 2004 Journal Article

Knowledge modeling and acquisition of traditional Chinese herbal drugs and formulae from text

  • Cungen Cao
  • Haitao Wang
  • Yuefei Sui

Traditional Chinese medicine has developed over more than 4000 years. A tremendous amount of medical knowledge has been accumulated, among which herbal drugs and formulae are an important portion. This paper presents an ontology for traditional Chinese drugs and formulae, and an ontology-based system for extracting knowledge of drugs and formulae from semi-structured text. The system consists of two components: an executable knowledge extraction language (or EKEL) for specifying knowledge-extracting agents, and a support machine for executing EKEL programs. Experiments show that the system is adequate of extracting knowledge of herbal drugs and formulae from semi-structured text.

v2026.09.13