22 research outputs found

    Preference-aware task assignment in on-demand taxi dispatching: An online stable matching approach

    Get PDF
    A central issue in on-demand taxi dispatching platforms is task assignment, which designs matching policies among dynamically arrived drivers (workers) and passengers (tasks). Previous matching policies maximize the profit of the platform without considering the preferences of workers and tasks (e.g., workers may prefer high-rewarding tasks while tasks may prefer nearby workers). Such ignorance of preferences impairs user experience and will decrease the profit of the platform in the long run. To address this problem, we propose preference-aware task assignment using online stable matching. Specifically, we define a new model, Online Stable Matching under Known Identical Independent Distributions (OSM-KIID). It not only maximizes the expected total profits (OBJ-1), but also tries to satisfy the preferences among workers and tasks by minimizing the expected total number of blocking pairs (OBJ-2). The model also features a practical arrival assumption validated on real-world dataset. Furthermore, we present a linear program based online algorithm LP-ALG, which achieves an online ratio of at least 1−1/e on OBJ-1 and has at most 0.6·|E| blocking pairs expectedly, where |E| is the total number of edges in the compatible graph. We also show that a natural Greedy can have an arbitrarily bad performance on OBJ-1 while maintaining around 0.5·|E| blocking pairs. Evaluations on both synthetic and real datasets confirm our theoretical analysis and demonstrate that LP-ALG strictly dominates all the baselines on both objectives when tasks notably outnumber workers

    Solving Challenging Math Word Problems Using GPT-4 Code Interpreter with Code-based Self-Verification

    Full text link
    Recent progress in large language models (LLMs) like GPT-4 and PaLM-2 has brought significant advancements in addressing math reasoning problems. In particular, OpenAI's latest version of GPT-4, known as GPT-4 Code Interpreter, shows remarkable performance on challenging math datasets. In this paper, we explore the effect of code on enhancing LLMs' reasoning capability by introducing different constraints on the \textit{Code Usage Frequency} of GPT-4 Code Interpreter. We found that its success can be largely attributed to its powerful skills in generating and executing code, evaluating the output of code execution, and rectifying its solution when receiving unreasonable outputs. Based on this insight, we propose a novel and effective prompting method, explicit \uline{c}ode-based \uline{s}elf-\uline{v}erification~(CSV), to further boost the mathematical reasoning potential of GPT-4 Code Interpreter. This method employs a zero-shot prompt on GPT-4 Code Interpreter to encourage it to use code to self-verify its answers. In instances where the verification state registers as ``False'', the model shall automatically amend its solution, analogous to our approach of rectifying errors during a mathematics examination. Furthermore, we recognize that the states of the verification result indicate the confidence of a solution, which can improve the effectiveness of majority voting. With GPT-4 Code Interpreter and CSV, we achieve an impressive zero-shot accuracy on MATH dataset \textbf{(53.9\% →\to 84.3\%)}.Comment: Solving Challenging Math Word Problems Using GPT-4 Code Interpreter with Code-based Self-Verificatio

    Compressive Behaviour of Aluminium Pyramidal Lattice Material-Filled Tubes

    No full text
    This study focuses on the uniaxial compressive behaviour of thin-walled Al alloy tubes filled with pyramidal lattice material. The mechanical properties of an empty tube, Al pyramidal lattice material, and pyramidal lattice material-filled tube were investigated. The results show that the pyramidal lattice material-filled tubes are stronger and provide greater energy absorption on account of the interaction between the pyramidal lattice material and the surrounding tube

    Adaptive task planning for large-scale robotized warehouses

    No full text
    Robotized warehouses are deployed to automatically distribute millions of items brought by the massive logistic orders from e-commerce. A key to automated item distribution is to plan paths for robots, also known as task planning, where each task is to deliver racks with items to pickers for processing and then return the rack back. Prior solutions are unfit for large-scale robotized warehouses due to the inflexibility to time-varying item arrivals and the low efficiency for high throughput. In this paper, we propose a new task planning problem called TPRW, which aims to minimize the end-to-end makespan that incorporates the entire item distribution pipeline, known as a fulfilment cycle. Direct extensions from state-of-the-art path finding methods are ineffective to solve the TPRW problem because they fail to adapt to the bottleneck variations of fulfillment cycles. In response, we propose Efficient Adaptive Task Planning, a framework for large-scale robotized warehouses with time-varying item arrivals. It adaptively selects racks to fulfill at each timestamp via reinforcement learning, accounting for the time-varying bottleneck of the fulfillment cycles. Then it finds paths for robots to transport the selected racks. The framework adopts a series of efficient optimizations on both time and memory to handle large-scale item throughput. Evaluations on both synthesized and real data show an improvement of 37.1%37.1\% in effectiveness and 75.5%75.5\% in efficiency over the state-of-the-arts

    Federated topic discovery: A semantic consistent approach

    No full text

    A Review of the Laser Cladding of Metal-Based Alloys, Ceramic-Reinforced Composites, Amorphous Alloys, and High-Entropy Alloys on Aluminum Alloys

    No full text
    As one of the lightest structural metals, the application breadth of aluminum alloys is, to some extent, constrained by their relatively low wear resistance and hardness. However, laser cladding technology, with its low dilution rate, compact structure, excellent coating-to-substrate bonding, and environmental advantages, can significantly enhance the surface hardness and wear resistance of aluminum alloys, thus proving to be an effective surface modification strategy. This review focuses on the topic of surface laser cladding materials for aluminum alloys, detailing the application background, process, microstructure, hardness, wear resistance, and corrosion resistance of six types of coatings, namely Al-based, Ni-based, Fe-based, ceramic-based, amorphous glass, and high-entropy alloys. Each coating type’s characteristics are summarized, providing theoretical references for designing and selecting laser cladding coatings for aluminum alloy surfaces. Furthermore, a prediction and outlook for the future development of laser cladding on the surface of aluminum alloys is also presented
    corecore